Perfect 2‑ coloring of the quartic graphs with order at most 8

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.

Golzadeh yazdan; ALAEIYAN MEHDI; GILANI ALIREZA

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

Journal Paper

Paper Information

Journal: MATHEMATICAL SCIENCES Year:2019 | Volume:13 | Issue:3 Page(s): 249-254

Download Full-Text

View:

195

Download:

158

Cites:

Information Journal Paper

Title

Perfect 2‑ coloring of the quartic graphs with order at most 8

Author(s)

Golzadeh yazdan | ALAEIYAN MEHDI | GILANI ALIREZA | Issue Writer Certificate

Keywords

Perfect coloring

Equitable partition

Quartic graph

Perfect code

Regular graph

Abstract

In this paper, we study perfect 2-coloring of the Quartic graphs with at most 8 vertices. The problem of the existence of Perfect coloring is a generalization of the concept of completely regular codes, given by Delsarte.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Golzadeh, yazdan, ALAEIYAN, MEHDI, & GILANI, ALIREZA. (2019). Perfect 2‑ coloring of the quartic graphs with order at most 8. MATHEMATICAL SCIENCES, 13(3), 249-254. SID. https://sid.ir/paper/322740/en

Vancouver: Copy

Golzadeh yazdan, ALAEIYAN MEHDI, GILANI ALIREZA. Perfect 2‑ coloring of the quartic graphs with order at most 8. MATHEMATICAL SCIENCES[Internet]. 2019;13(3):249-254. Available from: https://sid.ir/paper/322740/en

IEEE: Copy

yazdan Golzadeh, MEHDI ALAEIYAN, and ALIREZA GILANI, “Perfect 2‑ coloring of the quartic graphs with order at most 8,” MATHEMATICAL SCIENCES, vol. 13, no. 3, pp. 249–254, 2019, [Online]. Available: https://sid.ir/paper/322740/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops