Extremal problems for trees with given segment sequence

DOI10.1016/j.dam.2016.12.009zbMath1355.05079OpenAlexW2568232310MaRDI QIDQ507572

Eric Ould Dadah Andriantiana, Hua Wang, Stephan G. Wagner

Publication date: 6 February 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.12.009

zbMATH Keywords

matchingsindependent setsEstrada indexwalkssubtreesHosoya indexgraph energyMerrifield-Simmons indexsegment sequence

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Related Items (8)

Maximum number of subtrees in cacti and block graphs ⋮ The number of subtrees in graphs with given number of cut edges ⋮ Sombor index of trees with at most three branch vertices ⋮ Degree-based energies of trees ⋮ Extremal cover cost and reverse cover cost of trees with given segment sequence ⋮ Extremal trees of given segment sequence with respect to some eccentricity-based invariants ⋮ Extremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity ⋮ On the extremal Mostar indices of trees with a given segment sequence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The minimal number of subtrees of a tree
• The minimal number of subtrees with a given degree sequence
• The Estrada index of trees
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• On Estrada index of trees
• The Estrada index of chemical trees
• Binary trees with the largest number of subtrees
• The Merrifield - Simmons indices and Hosoya indices of trees with \(k\) pendant vertices
• Chemical trees minimizing energy and Hosoya index
• On the ordering of graphs with respect to their matching numbers
• On subtrees of trees
• Energy, Hosoya index and Merrifield-Simmons index of trees with prescribed degree sequence
• Further analysis on the total number of subtrees of trees
• Graphs, partitions and Fibonacci numbers
• Spectral moments of trees with given degree sequence
• Graph Energy
• The Number of Subtrees of Trees with Given Degree Sequence
• Maximizing the number of independent subsets over trees with bounded degree
• Correlation of Graph‐Theoretical Indices
• Wiener index of trees: Theory and applications

This page was built for publication: Extremal problems for trees with given segment sequence