Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs.
Ku, Cheng Yeaw, Wong, Kok Bin (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Algebraic matching theory.”
Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs.
Distance in graphs
Roger C. Entringer, Douglas E. Jackson, D. A. Snyder (1976)
Czechoslovak Mathematical Journal
Similarity:
Elongation in a graph
Bohdan Zelinka (1982)
Mathematica Slovaca
Similarity:
A Contribution to my Article: 'Introducing an Orientation into a Given Non-Directed Graph'
Bohdan Zelinka (1967)
Matematický časopis
Similarity:
On the Vertex Separation of Cactus Graphs
Markov, Minko (2007)
Serdica Journal of Computing
Similarity:
This paper is part of a work in progress whose goal is to construct a fast, practical algorithm for the vertex separation (VS) of cactus graphs. We prove a theorem for cacti", a necessary and sufficient condition for the VS of a cactus graph being k. Further, we investigate the ensuing ramifications that prevent the construction of an algorithm based on that theorem only.