Minimum Szeged index among unicyclic graphs with perfect matchings

DOI10.1007/S10878-019-00390-5MaRDI QIDQ2424820zbMATH OpenOpenAlexFDO

Authors Hechao Liu, Hanyuan Deng, Zikai Tang

Publication date 25 June 2019

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-019-00390-5

zbMATH Keywords

perfect matchingSzeged indexunicyclic graphs

Mathematics Subject Classification ID

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

Recommendations

• On the edge-Szeged index of unicyclic graphs with perfect matchings
• On the Szeged index of unicyclic graphs with given diameter
• Szeged index of a class of unicyclic graphs
• On the edge-Szeged index of unicyclic graphs with given diameter
• On revised Szeged index of a class of unicyclic graphs

Cites work

• scientific article; zbMATH DE number 4074878 (Why is no real title available?)
• scientific article; zbMATH DE number 1548995 (Why is no real title available?)
• scientific article; zbMATH DE number 1890079 (Why is no real title available?)
• scientific article; zbMATH DE number 1890094 (Why is no real title available?)
• scientific article; zbMATH DE number 1890134 (Why is no real title available?)
• On extremal cacti with respect to the Szeged index
• On Szeged indices of unicyclic graphs
• On the further relation between the (revised) Szeged index and the Wiener index of graphs
• The Factorization of Linear Graphs
• The Szeged and the Wiener index of graphs
• Wiener index of trees: Theory and applications

Cited in

(7)

• On the Szeged index of unicyclic graphs with given diameter
• The \(k\)-Szeged index of graphs
• On revised Szeged index of a class of unicyclic graphs
• scientific article; zbMATH DE number 7250390 (Why is no real title available?)
• scientific article; zbMATH DE number 7250395 (Why is no real title available?)
• General Sombor index: a study of branching in trees and solution for maximal trees with prescribed maximum degree
• On the edge-Szeged index of unicyclic graphs with perfect matchings

This page was built for publication: Minimum Szeged index among unicyclic graphs with perfect matchings

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