computation of various domination numbers of rolf nevanlinna (rnp) collaboration graph
Clicks: 143
ID: 160799
2017
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
Emerging Content
30.0
/100
143 views
31 readers
AI Quality Assessment
Not analyzed
Readership in this journal
EmergingRanked #132 of 150 articles by views in current drug delivery
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 150 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
ABSTRACT In this paper, we compute various Domination numbers like Outer Connected Domination (OCD), Doubly Connected Domination (DCD), Fair Domination (FD), Independence Domination (ID), 2-Packing (2-P) for Rolf Nevanlinna Prize Winners's Collaboration Graph (RNPCG).
| Reference Key |
v2017braziliancomputation
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Yegnanarayanan V;Logeshwary B |
| Journal | current drug delivery |
| Year | 2017 |
| DOI |
10.1590/1678-4324-2017160841
|
| URL | |
| Keywords | Keywords not found |
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.