Extremal Graphs with Respect to Matching Energy for Random Six-membered Ring Spiro Chains

Gutman and Wagner (in the matching energy of a graph, Disc. Appl. Math., 2012) defined the matching energy of a graph and pointed out that its chemical applications go back to the 1970s. Now the research on matching energy mainly focuses on graphs with pendent vertices and only a few papers reported...

Full description

Saved in:
Bibliographic Details
Published inActa Mathematicae Applicatae Sinica Vol. 35; no. 2; pp. 319 - 326
Main Authors Chen, Hua-mei, Liu, Yan
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2019
Springer Nature B.V
EditionEnglish series
Subjects
Apexes
Applications of Mathematics
Chains
Energy
Graph matching
Graphs
Math Applications in Computer Science
Mathematical and Computational Physics
Mathematics
Mathematics and Statistics
Organic chemistry
Random variables
Theoretical
six-membered ring spiro chains
random
matching energy
Online AccessGet full text
ISSN0168-9673
1618-3932
DOI10.1007/s10255-019-0820-z

Cover

More Information
Summary:Gutman and Wagner (in the matching energy of a graph, Disc. Appl. Math., 2012) defined the matching energy of a graph and pointed out that its chemical applications go back to the 1970s. Now the research on matching energy mainly focuses on graphs with pendent vertices and only a few papers reported the progress on matching energy of graphs without pendent vertices. For a random six-membered ring spiro chain, the number of k -matchings and the matching energy are random variables. In this paper, we determine the extremal graphs with respect to the matching energy for random six-membered ring spiro chains which have no pendent vertices.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0168-9673
1618-3932
DOI:10.1007/s10255-019-0820-z