Cut and pendant vertices and the number of connected induced subgraphs of a graph

DOI10.1007/s40879-020-00443-8zbMath1468.05117arXiv1910.04552OpenAlexW3121094638MaRDI QIDQ2040982

Audace A. V. Dossou-Olory

Publication date: 15 July 2021

Published in: European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.04552

zbMATH Keywords

treeinduced subgraphconnected graphpendant vertexcut vertexextremal graph structure

Mathematics Subject Classification ID

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

Related Items (3)

Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs ⋮ Extremal problems for connected set enumeration ⋮ The number of subtrees in graphs with given number of cut edges

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greedy trees, subtrees and antichains
• The sum of the distances between the leaves of a tree and the `semi-regular' property
• Monotonicity of the mean order of subtrees
• Enumeration of subtrees of trees
• Binary trees with the largest number of subtrees
• Mean distance in a graph
• On subtrees of trees
• On the average number of nodes in a subtree of a tree
• Further analysis on the total number of subtrees of trees
• An Elementary Theorem on Graphs
• On the sum of all distances in a graph or digraph
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• A Characterization of Block-Graphs
• Distance in graphs
• Leaf-induced subtrees of leaf-Fibonacci trees
• Correlation of Graph‐Theoretical Indices
• Minimally 2-connected graphs.

This page was built for publication: Cut and pendant vertices and the number of connected induced subgraphs of a graph