Maximising the number of connected induced subgraphs of unicyclic graphs

DOI10.55730/1300-0098.3337MaRDI QIDQ5879474zbMATH OpenOpenAlexFDO

Authors Audace A. V. Dossou-Olory

Publication date 1 March 2023

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

Full work available at URL https://doi.org/10.55730/1300-0098.3337

zbMATH Keywords

girthinduced subgraphsunicyclic graphspendant verticesconnected graphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Recommendations

• scientific article; zbMATH DE number 7714103
• On the number of connected subgraphs of graphs
• The numbers of maximal independent sets in connected unicyclic graphs
• The number of independent sets in unicyclic graphs
• Cut and pendant vertices and the number of connected induced subgraphs of a graph

Cites work

• scientific article; zbMATH DE number 5297496 (Why is no real title available?)
• scientific article; zbMATH DE number 2239329 (Why is no real title available?)
• Binary trees with the largest number of subtrees
• Monotonicity of the mean order of subtrees
• On extremal unicyclic molecular graphs with prescribed girth and minimal Hosoya index
• On subtrees of trees
• On the Wiener index of unicyclic graphs
• On the average number of nodes in a subtree of a tree
• On the number of connected subgraphs of graphs

Cited in

(4)

• Cut and pendant vertices and the number of connected induced subgraphs of a graph
• scientific article; zbMATH DE number 7714103 (Why is no real title available?)
• Maximizing Algebraic Connectivity Over Unicyclic Graphs
• A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks

This page was built for publication: Maximising the number of connected induced subgraphs of unicyclic graphs

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