Maximising the number of connected induced subgraphs of unicyclic graphs

DOI10.55730/1300-0098.3337zbMATH Open1506.05097OpenAlexW4287901845MaRDI QIDQ5879474FDOQ5879474

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

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

zbMATH Keywords

girthinduced subgraphsunicyclic graphspendant verticesconnected graphs

Mathematics Subject Classification ID

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

Cites Work

• On subtrees of trees
• Binary trees with the largest number of subtrees
• On the average number of nodes in a subtree of a tree
• Monotonicity of the mean order of subtrees
• Title not available (Why is that?)
• On extremal unicyclic molecular graphs with prescribed girth and minimal Hosoya index
• Title not available (Why is that?)
• On the Wiener index of unicyclic graphs
• On the number of connected subgraphs of graphs

Cited In (4)

• Maximizing Algebraic Connectivity Over Unicyclic Graphs
• Cut and pendant vertices and the number of connected induced subgraphs of a graph
• A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks
• Title not available (Why is that?)

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)