Some extremal problems on the distance involving peripheral vertices of trees with given matching number

DOI10.1016/j.dam.2022.12.018OpenAlexW4313368250MaRDI QIDQ2112659

Shuchao Li, Huihui Zhang, Nannan Liu

Publication date: 11 January 2023

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

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

zbMATH Keywords

treenormalitydiametermatching number

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eccentricity sums in trees
• Some edge-grafting transformations on the eccentricity resistance-distance sum and their applications
• Unique eccentric point graphs
• Matching theory
• Eccentric sequences in graphs
• The anti-adjacency matrix of a graph: eccentricity matrix
• Edge-grafting transformations on the average eccentricity of graphs and their applications
• Solutions for two conjectures on the eigenvalues of the eccentricity matrix, and beyond
• The normality and sum of normalities of trees
• Graph energy based on the eccentricity matrix
• On the maximal connective eccentricity index of bipartite graphs with some given parameters
• On two eccentricity-based topological indices of graphs
• Upper bounds on the average eccentricity
• A generalized algorithm for centrality problems on trees

This page was built for publication: Some extremal problems on the distance involving peripheral vertices of trees with given matching number