on coefficients of path polynomials

Clicks: 101
ID: 213887
1984
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.
AI Quality Assessment
Not analyzed
Readership in this journal
Popular

Ranked #193 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 minted

Create 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
Explicit formulae, in terms of sugraphs of the graph, are given for the first six coefficients of the simple path polynomial of a graph. From these, explicit formulae are deduced for the number of hamiltonian paths in graphs with up to six nodes. Also simplified expressions are given for the number of ways of covering the nodes of some families of graphs with k paths, for certain values of k.
Reference Key
farrell1984internationalon Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors
Journal structural engineering and mechanics
Year 1984
DOI
10.1155/S0161171284000065
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.