Chordal 2-connected graphs and spanning trees

DOI10.1002/JGT.21761MaRDI QIDQ5495883zbMATH OpenOpenAlexFDO

Authors Zbigniew R. Bogdanowicz

Publication date 7 August 2014

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.21761

zbMATH Keywords

chordal graphenumeration of treesminimizationshift transformationspanning treethreshold graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• On family of graphs with minimum number of spanning trees
• Undirected simple connected graphs with minimum number of spanning trees
• A solution of Chartrand's problem on spanning trees
• scientific article; zbMATH DE number 2188327
• scientific article; zbMATH DE number 5139506

Cites work

• A certain polynomial of a graph and graphs with an extremal number of trees
• A characterization of perfect graphs
• A reliability-improving graph transformation with applications to network reliability
• Counting labelled chordal graphs
• Enumeration of P₄-free chordal graphs
• Network transformations and bounding network reliability
• Undirected simple connected graphs with minimum number of spanning trees

Cited in

(10)

• Undirected simple connected graphs with minimum number of spanning trees
• Graph vulnerability parameters, compression, and threshold graphs
• On the minimum number of spanning trees in cubic multigraphs
• Extremal graphs for the Tutte polynomial
• TREE DIAGRAMS FOR STRING LINKS II: DETERMINING CHORD DIAGRAMS
• scientific article; zbMATH DE number 2188327 (Why is no real title available?)
• On q-connected chordal graphs with minimum number of spanning trees
• Maximum number of spanning trees and connectivity: graphs with a fixed minimum degree and bipartite graphs
• On topological indices, graph compression, and threshold graphs
• Cubic graphs and quartic graphs with the minimum number of spanning forests

This page was built for publication: Chordal 2-connected graphs and spanning trees

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