On the number of connected subgraphs of graphs

DOI10.1007/s13226-021-00061-4zbMath1473.05054OpenAlexW3167056072MaRDI QIDQ2243091

Kamal Lochan Patra, Dinesh Pandey

Publication date: 10 November 2021

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13226-021-00061-4

zbMATH Keywords

treegirthWiener indexunicyclic graphsubtree core

Mathematics Subject Classification ID

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

Related Items (2)

Maximising the number of connected induced subgraphs of unicyclic graphs ⋮ A study on free roots of Borcherds-Kac-Moody Lie superalgebras

Cites Work

• Unnamed Item
• Unnamed Item
• The minimal number of subtrees of a tree
• The minimal number of subtrees with a given degree sequence
• Enumeration of subtrees of trees
• Binary trees with the largest number of subtrees
• On subtrees of trees
• Trees with the mos subtrees - an algorithmic approach
• Further analysis on the total number of subtrees of trees
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• The number of subtrees of trees with given diameter
• The Number of Subtrees of Trees with Given Degree Sequence
• Trees with large numbers of subtrees

This page was built for publication: On the number of connected subgraphs of graphs