Publish in OALib Journal
ISSN: 2333-9721
APC: Only $99

Paper Submission

Views	Downloads

Relative Articles
Betweenness Centrality in Some Classes of Graphs
Reed's conjecture on some special classes of graphs
Hamiltonian Paths in Some Classes of Grid Graphs
Star edge coloring of some classes of graphs
Some New Classes of Open Distance-Pattern Uniform Graphs
On $\mathcal{D}$-equivalence classes of some graphs
Rainbow domination and related problems on some classes of perfect graphs
Some classes of general nonconvex variational inequalities.
On the Cluster Size Distribution for Percolation on Some General Graphs
Rainbow Graphs and Switching Classes
More...

International Journal of Mathematics and Mathematical Sciences 1987

Some general classes of comatching graphs

DOI: 10.1155/s0161171287000619

E. J. Farrell,S. A. Wahid

Keywords: matching polynomial , comatching graphs , weight , chains , cycles , attaching graphs to other graphs.

Full-Text Cite this paper Add to My Lib

Abstract:

Some sufficient conditions are given for two graphs to have the same matching polynomial (comatching graphs). Several general classes of comatching graphs are given. Also, techniques are discussed for extending certain pairs of comatching graphs to larger pairs of comatching graphs.

Full-Text