A Note on Acyclic Coloring of Strong Product of 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.

Babu P. Shanas; A.V. Chithra

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

Journal Paper

Paper Information

Journal: Iranian Journal of Mathematical Sciences and Informatics Year:2024 | Volume:19 | Issue:1 Page(s): 149-160

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

A Note on Acyclic Coloring of Strong Product of Graphs

Author(s)

Babu P. Shanas | A.V. Chithra | Issue Writer Certificate

Keywords

Strong product of graphs

Acyclic coloring

Acyclic chromatic number

Abstract

A vertex coloring of a graph G is called acyclic if no two adjacent vertices have the same color and no cycle in G is bichromatic. The Acyclic chromatic number a(G) of a graph G is the least number of colors in an Acyclic coloring of G. In this paper, we obtain bound for the Acyclic chromatic number of the strong product of a tree and a graph. An exact value for the Acyclic chromatic number of the strong product of two trees is derived. Further observations are made on the upper bound for the strong product of three paths.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans