computation of various domination numbers of rolf nevanlinna (rnp) collaboration graph
Clicks: 112
ID: 160799
2017
Article Quality & Performance Metrics
Overall Quality
Improving Quality
0.0
/100
Combines engagement data with AI-assessed academic quality
Reader Engagement
Popular Article
30.0
/100
110 views
12 readers
Trending
AI Quality Assessment
Not analyzed
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.