connections between the matching and chromatic polynomials
Clicks: 246
ID: 258985
1992
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Popular Article
30.0
/100
246 views
23 readers
AI Quality Assessment
Not analyzed
Readership in this journal
PopularRanked #10 of 403 articles by views in structural engineering and mechanics
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 403 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
The main results established are (i) a connection between the matching and chromatic polynomials and (ii) a formula for the matching polynomial of a general complement of a subgraph of a graph. Some deductions on matching and chromatic equivalence and uniqueness are made.
| Reference Key |
farrell1992internationalconnections
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;E. J. Farrell;Earl Glen Whitehead |
| Journal | structural engineering and mechanics |
| Year | 1992 |
| DOI |
10.1155/S016117129200098X
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.