Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs
Electronic Journal of Combinatorics
Saved in:
Main Authors: | Ku, C.Y., Wong, K.B. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/103537 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover
by: Ku, C.Y., et al.
Published: (2014) -
Generalized D-graphs for nonzero roots of the matching polynomial
by: Ku, C.Y., et al.
Published: (2014) -
Extensions of barrier sets to nonzero roots of the matching polynomial
by: Ku, C.Y., et al.
Published: (2014) -
Gallai-Edmonds structure theorem for weighted matching polynomial
by: Ku, C.Y., et al.
Published: (2014) -
ROOTS OF MATCHING POLYNOMIALS
by: LIM POH SIEW
Published: (2021)