Extremal bipartite graphs of given connectivity with respect to matching energy
- 1 April 2018
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 239, 200-205
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61572190)
- Hunan Provincial Innovation Foundation for Postgraduate (CX2017B170)
This publication has 12 references indexed in Scilit:
- The matching energy of random graphsDiscrete Applied Mathematics, 2015
- The expected values of Hosoya index and Merrifield–Simmons index in a random polyphenylene chainJournal of Combinatorial Optimization, 2015
- Extremal t‐apex trees with respect to matching energyComplexity, 2015
- Matching energy of unicyclic and bicyclic graphs with a given diameterComplexity, 2014
- The matching energy of graphs with given parametersDiscrete Applied Mathematics, 2014
- The matching energy of a graphDiscrete Applied Mathematics, 2012
- The Hosoya indices and Merrifield–Simmons indices of graphs with connectivity at most kApplied Mathematics Letters, 2012
- An introduction to matching polynomialsJournal of Combinatorial Theory, Series B, 1979
- Acyclic systems with extremal H ckel ?-electron energyTheoretical Chemistry Accounts, 1977
- Topological Index. A Newly Proposed Quantity Characterizing the Topological Nature of Structural Isomers of Saturated HydrocarbonsBulletin of the Chemical Society of Japan, 1971