PERFECT SECURE DOMINATION IN GRAPHS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

RASHMI S.V. DIVYA; ARUMUGAM SUBRAMANIAN; BHUTANI KIRAN R.; GARTLAND PETER

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: CATEGORIES AND GENERAL ALGEBRAIC STRUCTURES WITH APPLICATIONS Year:2017 | Volume:7 | Issue:SUPP. Page(s): 125-140

Download Full-Text

Persian Verion

View:

751

Download:

176

Cites:

Information Journal Paper

Title

PERFECT SECURE DOMINATION IN GRAPHS

Author(s)

RASHMI S.V. DIVYA | ARUMUGAM SUBRAMANIAN | BHUTANI KIRAN R. | GARTLAND PETER | Issue Writer Certificate

Keywords

SECURE DOMINATIONQ4

PERFECT SECURE DOMINATIONQ4

SECURE DOMINATION NUMBERQ4

PERFECT SECURE DOMINATION NUMBERQ4

Abstract

Let G= (V, E) be a graph. A subset S of V is a dominating set of G if every vertex in V \ S is adjacent to a vertex in S. A dominating set S is called a secure dominating set if for each v Î V \ S there exists u 2 S such that v is adjacent to u and S1= (S \ {u}) È {v} is a dominating set. If further the vertex u Î S is unique, then S is called a perfect secure dominating set.The minimum cardinality of a perfect secure dominating set of G is called the perfect SECURE DOMINATION number of G and is denoted by gps (G). In this paper we initiate a study of this parameter and present several basic results.

Cites

No record.

References

No record.

Cite

APA: Copy

RASHMI, S.V. DIVYA, ARUMUGAM, SUBRAMANIAN, BHUTANI, KIRAN R., & GARTLAND, PETER. (2017). PERFECT SECURE DOMINATION IN GRAPHS. CATEGORIES AND GENERAL ALGEBRAIC STRUCTURES WITH APPLICATIONS, 7(SUPP.), 125-140. SID. https://sid.ir/paper/255407/en

Vancouver: Copy

RASHMI S.V. DIVYA, ARUMUGAM SUBRAMANIAN, BHUTANI KIRAN R., GARTLAND PETER. PERFECT SECURE DOMINATION IN GRAPHS. CATEGORIES AND GENERAL ALGEBRAIC STRUCTURES WITH APPLICATIONS[Internet]. 2017;7(SUPP.):125-140. Available from: https://sid.ir/paper/255407/en

IEEE: Copy

S.V. DIVYA RASHMI, SUBRAMANIAN ARUMUGAM, KIRAN R. BHUTANI, and PETER GARTLAND, “PERFECT SECURE DOMINATION IN GRAPHS,” CATEGORIES AND GENERAL ALGEBRAIC STRUCTURES WITH APPLICATIONS, vol. 7, no. SUPP., pp. 125–140, 2017, [Online]. Available: https://sid.ir/paper/255407/en

Related Journal Papers