The Ordering of the Unicyclic Graphs with respect to Largest Matching Root with Given Matching Numbe...
The Ordering of the Unicyclic Graphs with respect to Largest Matching Root with Given Matching Number
About this item
Full title
Author / Creator
Publisher
Cairo: Hindawi
Journal title
Language
English
Formats
Publication information
Publisher
Cairo: Hindawi
Subjects
More information
Scope and Contents
Contents
The matching roots of a simple connected graph G are the roots of the matching polynomial which is defined as MGx=∑k=0n/2−1kmG,kxn−2k, where mG,k is the number of the k matchings of G. Let λ1G denote the largest matching root of the graph G. In this paper, among the unicyclic graphs of order n, we present the ordering of the unicyclic graphs with m...
Alternative Titles
Full title
The Ordering of the Unicyclic Graphs with respect to Largest Matching Root with Given Matching Number
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_fd78b4374e324f4bab961b6e2bdace0f
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_fd78b4374e324f4bab961b6e2bdace0f
Other Identifiers
ISSN
2314-4629
E-ISSN
2314-4785
DOI
10.1155/2022/3589448
