scientific article; zbMATH DE number 5938876

zbMATH Open1228.05194MaRDI QIDQ5199847FDOQ5199847

Authors: Rolito G. Eballe, S. R. Canoy 

Publication date: 16 August 2011

Title of this publication is not available (Why is that?)

Recommendations

• The connected cutset connectivity of a graph
• A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
• Parameterizing cut sets in a graph by the number of their components
• Parameterizing cut sets in a graph by the number of their components
• On essential components and critical sets of a graph
• On enumeration of labelled connected graphs by the number of cutpoints
• The connectivity of a graph and its complement
• The \(g\)-component connectivity of graphs
• The tree of cuts and minimal \(k\)-connected graphs
• An upper bound on algebraic connectivity of graphs with many cutpoints

Mathematics Subject Classification ID

Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Cited In (3)

• The connected cutset connectivity of a graph
• DOMINATION DEFECT IN THE COMPOSITION OF GRAPHS
• INDEPENDENT SEMITOTAL DOMINATION IN THE LEXICOGRAPHIC PRODUCT OF GRAPHS

This page was built for publication:

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