Constructing Matching Equivalent Graphs - Applied Mathematics

AM > Vol.8 No.4, April 2017

Applied Mathematics

Volume 8, Issue 4 (April 2017)

ISSN Print: 2152-7385 ISSN Online: 2152-7393

Google-based Impact Factor: 0.58 Citations

Constructing Matching Equivalent Graphs ()

HTML XML

Download as PDF (Size: 674KB) PP. 476-482

DOI: 10.4236/am.2017.84038 6,795 Downloads 8,014 Views

Author(s)

Tingzeng Wu¹, Huazhong Lü²

Affiliation(s)

¹School of Mathematics and Statistics, Qinghai Nationalities University, Xining, China.
²School of Mathematics Science, University of Electronic Science and Technology of China, Chengdu, China.

ABSTRACT

Two nonisomorphic graphs G and H are said to be matching equivalent if and only if G and H have the same matching polynomials. In this paper, some families matching equivalent graphs are constructed. In particular, a new method to construct cospectral forests is given.

KEYWORDS

Matching Polynomial, Matching Equivalent, Cospectral

Share and Cite:

Wu, T. and Lü, H. (2017) Constructing Matching Equivalent Graphs. Applied Mathematics, 8, 476-482. doi: 10.4236/am.2017.84038.

Cited by

No relevant information.

Journals Menu