8 citations · 33 across the 46 of their papers we have counts for
57 papers
Trees with at least vertices are -reconstructible
Alexandr V. Kostochka, Mina Nahvi, Douglas B. West +1
The -deck of an -vertex graph is the multiset of (unlabeled) subgraphs obtained from it by deleting vertices. An -vertex graph is -reconstructible if i…
Bounds for eccentricity-based parameters of graphs
Yunfang Tang, Xuli Qi, Douglas B. West
The \emph{eccentricity} of a vertex in a graph , denoted by , is the maximum distance from to other vertices in . We study extremal problems for the average e…
-Reconstructibility of Weakly Distance-Regular Graphs
Douglas B. West, Xuding Zhu
A graph is -reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting vertices. We prove that strongly regular graphs with at least…
Some new results on bar visibility of digraphs
Yuanrui Feng, Jun Ge, Douglas B. West +1
Visibility representation of digraphs was introduced by Axenovich, Beveridge, Hutch\-inson, and West (\emph{SIAM J. Discrete Math.} {\bf 27}(3) (2013) 1429--1449) as a natural gene…
On reconstruction of graphs from the multiset of subgraphs obtained by deleting vertices
Alexandr V. Kostochka, Douglas B. West
The Reconstruction Conjecture of Ulam asserts that, for , every -vertex graph is determined by the multiset of its induced subgraphs with vertices. The conjecture…
The Number of Perfect Matchings in Möbius Ladders and Prisms
R. S. Lekshmi, Douglas B. West
The 1970s conjecture of Lovász and Plummer that the number of perfect matchings in any -regular graph is exponential in the number of vertices was proved in 2011 by Esperet, Kar…