edge-neighbor-rupture degree of graphs
Clicks: 94
ID: 173967
2013
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
Steady Performance
27.9
/100
94 views
21 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #201 of 357 articles by views in Chemico-biological interactions
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 357 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 edge-neighbor-rupture degree of a connected graph is defined to be , where is any edge-cut-strategy of , is the number of the components of , and is the maximum order of the components of . In this paper, the edge-neighbor-rupture degree of some graphs is obtained and the relations between edge-neighbor-rupture degree and other parameters are determined.
| Reference Key |
aslan2013journaledge-neighbor-rupture
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Ersin Aslan |
| Journal | Chemico-biological interactions |
| Year | 2013 |
| DOI |
10.1155/2013/783610
|
| 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.