Extremal problems for trees with given segment sequence

DOI10.1016/J.DAM.2016.12.009MaRDI QIDQ507572zbMATHOpenAlexFDO

Authors Eric Ould Dadah Andriantiana, Hua Wang, Stephan 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

Estrada indexwalksmatchingsindependent setssubtreesgraph energyHosoya indexMerrifield-Simmons indexsegment sequence

Mathematics Subject Classification ID

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

Recommendations

• Extremal trees of given segment sequence with respect to some eccentricity-based invariants
• On the extremal Mostar indices of trees with a given segment sequence
• Extremal trees with fixed degree sequence
• Extremal problems for colored trees and Davenport-Schinzel sequences
• scientific article; zbMATH DE number 7653615
• Maximum trees of finite sequences
• scientific article; zbMATH DE number 5656438
• Extremal trees with given degree sequence for the Randić index
• Trees with extremal numbers of dominating sets
• On an extremal problem for colored trees

Cites work

• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 6933244 (Why is no real title available?)
• scientific article; zbMATH DE number 6750302 (Why is no real title available?)
• scientific article; zbMATH DE number 5251556 (Why is no real title available?)
• scientific article; zbMATH DE number 6256254 (Why is no real title available?)
• A proof of a conjecture on the Estrada index
• An upper bound on the number of independent sets in a tree.
• Binary trees with the largest number of subtrees
• Chemical trees minimizing energy and Hosoya index
• Correlation of Graph‐Theoretical Indices
• Energy, Hosoya index and Merrifield-Simmons index of trees with prescribed degree sequence
• Further analysis on the total number of subtrees of trees
• Graph energy
• Graphs, partitions and Fibonacci numbers
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• Maximizing the number of independent subsets over trees with bounded degree
• On Estrada index of trees
• On segment sequences and the Wiener index of trees
• On subtrees of trees
• On the Fibonacci numbers of trees
• On the Merrifield-Simmons index of trees
• On the ordering of graphs with respect to their matching numbers
• Some graphs with minimum Hosoya index and maximum Merrifield--Simmons index
• Spectral moments of trees with given degree sequence
• The Estrada index of chemical trees
• The Estrada index of trees
• The Merrifield - Simmons indices and Hosoya indices of trees with \(k\) pendant vertices
• The minimal number of subtrees of a tree
• The minimal number of subtrees with a given degree sequence
• The number of subtrees of trees with given degree sequence
• Wiener index of trees: Theory and applications

Cited in

(9)

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

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

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