Reconstruction of Cacti

DOI10.4153/CJM-1969-149-3MaRDI QIDQ5578818zbMATH OpenWikidataFDO

Authors Dennis P. Geller, Bennet Manvel

Publication date 1969

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1969-149-3

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cited in

(17)

• Extremal cacti of given matching number with respect to the distance spectral radius
• Dyadic representations of graphs
• Reconstruction of the set of branches of a graph
• Reconstructibility of unrooted level-k phylogenetic networks from distances
• The reconstruction of outerplanar graphs
• Zeroth-order general Randić index of cactus graphs
• Graphs constructible from cycles and complete graphs
• Reconstruction of maximal outerplanar graphs
• Reconstructing the degree pair sequence of a digraph
• Reconstructing cactus graphs from shortest path information (extended abstract)
• On a conjecture for the signless Laplacian spectral radius of cacti with given matching number
• ON α,β DESTRUCTIBLE GRAPHS
• The converse of Kelly's lemma and control-classes in graph reconstruction
• On the spectral radius of cacti with \(k\)-pendant vertices
• Graph reconstruction—a survey
• On the complexity of graph reconstruction
• Technical note: The competitive facility location problem in a duopoly: advances beyond trees

This page was built for publication: Reconstruction of Cacti

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5578818)