Silver coloring of generalized Petersen 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.

Besharati Nazli

Educational Videos and Scientific Workshops

Scientific Information Database

ISSN: 2588-4824

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF NEW RESEARCHES IN MATHEMATICS Year:2021 | Volume:6 | Issue:28 Page(s): 63-73

Download Full-Text

Persian Verion

View:

263

Download:

Cites:

Information Journal Paper

Title

Silver coloring of generalized Petersen graphs

Author(s)

Besharati Nazli | Issue Writer Certificate

Keywords

Chromatic number

Defining set

Silver coloring

Generalized Petersen Graphs

Independent Set

Abstract

In a graph G=(V, E), an Independent Set I(G) is a subset of the vertices of G such that no two vertices in I(G) are adjacent. Any maximum Independent Set of a graph is called a diagonal of the graph. Let c be a proper (r+1)-coloring of an r-regular graph G. A vertex v in G is said to be rainbow with respect to c if every color appears in the closed neighborhood N[v]=N(v)∪ {v}. Given a diagonal I of G, the coloring c is said to be silver with respect to I if every v∈ I is rainbow with respect to c. G is called silver if it admits a Silver coloring with respect to some diagonal. In [1], the authors introduced Silver coloring and the following question is raised “ Find classes of r-regular graphs G, that G is a silver graph". This paper is aimed toward study this question for the Generalized Petersen Graphs. In this paper we show that, if n≡ 0 (mod4) and k is odd, then P(n, k) is a totally silver graph. Also, for every natural number n, the existence of Silver coloring for Generalized Petersen Graphs P(n, 1), P(n, 2) except for n=5, this is well-known petersen graph, P(n, 3) except for n=10, 14 and 26. Also, for any k>2, P(2k+1, k), and for any k>3, P(3k+1, k), and for any k>3, k ≠ 5, 9 P(3k-1, k) are silver graphs.

Cites

No record.

References

No record.

Cite

APA: Copy

Besharati, Nazli. (2021). Silver coloring of generalized Petersen graphs. JOURNAL OF NEW RESEARCHES IN MATHEMATICS, 6(28 ), 63-73. SID. https://sid.ir/paper/951831/en

Vancouver: Copy

Besharati Nazli. Silver coloring of generalized Petersen graphs. JOURNAL OF NEW RESEARCHES IN MATHEMATICS[Internet]. 2021;6(28 ):63-73. Available from: https://sid.ir/paper/951831/en

IEEE: Copy

Nazli Besharati, “Silver coloring of generalized Petersen graphs,” JOURNAL OF NEW RESEARCHES IN MATHEMATICS, vol. 6, no. 28 , pp. 63–73, 2021, [Online]. Available: https://sid.ir/paper/951831/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops

Download

Move to top

وبگردی