Computation of Various Domination Numbers of Rolf Nevanlinna (RNP) Collaboration Graph

Yegnanarayanan, V.; Logeshwary, B.

doi:10.1590/1678-4324-2017160841

Braz. arch. biol. technol.

2017

DOI: 10.1590/1678-4324-2017160841

|View full text |Cite

Computation of Various Domination Numbers of Rolf Nevanlinna (RNP) Collaboration Graph

V. Yegnanarayanan

B. Logeshwary

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).

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

References 23 publications

(35 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

Computation of certain domination numbers of collaboration graphs

Anitha,

Venkatraman

2024

J Anal

View full text Add to dashboard Cite

Computation of certain domination numbers of collaboration graphs

Anitha,

Venkatraman

2024

J Anal

View full text Add to dashboard Cite

Finding the domination number of triangular belt networks

Almotairi,

Alharbi,

Alzaid

et al. 2024

Math. models, eng.

View full text Add to dashboard Cite

Domination in graphs has been an extensively researched branch of graph theory. A set S⊆V is said to be the dominating set of graph G if for every v∈V-S there exists a vertex u∈S such that uv∈E. The minimum cardinality of vertices among the dominating set of G is called the domination number of G denoted by γ(G). The main object of this paper is to study the domination number of some networks such as triangular belt networks TBn, alternate triangular belt networks ATBn and restricted square of bistar networks Bn,n.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Computation of Various Domination Numbers of Rolf Nevanlinna (RNP) Collaboration Graph

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).

Cited by 2 publications

References 23 publications

Computation of certain domination numbers of collaboration graphs

Computation of certain domination numbers of collaboration graphs

Finding the domination number of triangular belt networks

Contact Info

Product

Resources

About