Some general classes of comatching graphs

DOI10.1155/S0161171287000619MaRDI QIDQ1092933zbMATH OpenOpenAlexFDO

Authors E. J. Farrell, S. A. Wahid

Publication date 1987

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/46222

zbMATH Keywords

weightcyclesmatching polynomialchainscomatching graphsattaching graphs to other graphs

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 951843
• scientific article; zbMATH DE number 1279034
• Matching equivalencies of bipartite graphs
• On ``The matching polynomial of a polygraph
• The matching equivalence classes of graphs with the maximum matching root less than or equal to 2

Cited in

(7)

• On the matching polynomial and its relation to the rook polynomial
• On ordering of complements of graphs with respect to matching numbers
• scientific article; zbMATH DE number 4031747 (Why is no real title available?)
• The exactly divide ability of several matching polynomial of graphs and the matching equivalent graphs of \(T_{2,2,n}\)
• On the theory of matching equivalent graphs and rook equivalent chessboards
• scientific article; zbMATH DE number 6493054 (Why is no real title available?)
• Classes of graphs which approximate the complete Euclidean graph

This page was built for publication: Some general classes of comatching graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1092933)