General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number

DOI10.1007/s10878-020-00643-8zbMath1468.05045OpenAlexW3082459548MaRDI QIDQ830932

Selvaraj Balachandran, Tomáš Vetrík

Publication date: 10 May 2021

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

Full work available at URL: https://doi.org/10.1007/s10878-020-00643-8

zbMATH Keywords

treematchingunicyclic graphmultiplicative Zagreb index

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Related Items (2)

Extremal quasi-unicyclic graphs with respect to vertex-degree function index ⋮ Extremal quasi-unicyclic graphs with respect to the general multiplicative Zagreb indices

Cites Work

• Multiplicative Zagreb indices of \(k\)-trees
• Note on the multiplicative Zagreb indices
• Bounds on the largest eigenvalues of trees with a given size of matching
• General multiplicative Zagreb indices of trees
• Partial orthogonal rank-one decomposition of complex symmetric tensors based on the Takagi factorization
• Sharp upper bounds for multiplicative Zagreb indices of bipartite graphs with given diameter
• On extremal multiplicative Zagreb indices of trees with given number of vertices of maximum degree
• The multiplicative Zagreb indices of graph operations
• Multiplicative Zagreb indices and coindices of some derived graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number