Downloads provided by UsageCounts
A set S is a complementary perfect triple connected dominating set, if is a triple connected dominating set of G and the induced sub graph has a perfect matching. The complementary perfect triple connected domination number is the minimum cardinality taken over all complementary perfect triple connected dominating sets in G. A graph labeling is a one to one function that carries a set of elements onto set of integers called labels. Here we discuss some standard graphs which has vertex bimagic labelings and for which complementary perfect triple connected domination number exists.
Dominating set, CPTC Dominating set, VBTL and Standard graphs.
Dominating set, CPTC Dominating set, VBTL and Standard graphs.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 4 | |
| downloads | 2 |

Views provided by UsageCounts
Downloads provided by UsageCounts