Extremal t‐apex trees with respect to matching energy
- 6 January 2015
- journal article
- research article
- Published by Wiley in Complexity
- Vol. 21 (5) , 238-247
Abstract
The matching energy of a graph is defined as the sum of the absolute values of the zeros of its matching polynomial. For any integer t≥1, a graph G is called t‐apex tree if there exists a t‐set such that G − X is a tree, while for any with , G − Y is not a tree. Let be the set of t‐apex trees of order n. In this article, we determine the extremal graphs from with minimal and maximal matching energies, respectively. Moreover, as an application, the extremal cacti of order n and with s cycles have been completely characterized at which the minimal matching energy are attained. © 2015 Wiley Periodicals, Inc. Complexity 21: 238–247, 2016Keywords
This publication has 15 references indexed in Scilit:
- Matching energy of unicyclic and bicyclic graphs with a given diameterComplexity, 2014
- Connections between generalized graph entropies and graph energyComplexity, 2014
- The Hosoya indices and Merrifield–Simmons indices of graphs with connectivity at most kApplied Mathematics Letters, 2012
- Maxima and Minima of the Hosoya Index and the Merrifield-Simmons IndexActa Applicandae Mathematicae, 2010
- On the Hosoya index and the Merrifield–Simmons index of graphs with a given clique numberApplied Mathematics Letters, 2010
- On the theory of the matching polynomialJournal of Graph Theory, 1981
- An introduction to matching polynomialsJournal of Combinatorial Theory, Series B, 1979
- Acyclic systems with extremal H ckel ?-electron energyTheoretical Chemistry Accounts, 1977
- Graph Theory with Applications1976
- Topological Index. A Newly Proposed Quantity Characterizing the Topological Nature of Structural Isomers of Saturated HydrocarbonsBulletin of the Chemical Society of Japan, 1971