CHROMATICITY OF TURAN GRAPHS WITH AT MOST THREE EDGES DELETED

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.

LAU GEE CHOON; PENG YEE HOCK; ALIKHANI SAEID

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

Journal Paper

Paper Information

Journal: Iranian Journal of Mathematical Sciences and Informatics Year:2014 | Volume:9 | Issue:2 Page(s): 45-64

Download Full-Text

View:

422

Download:

138

Cites:

Information Journal Paper

Title

CHROMATICITY OF TURAN GRAPHS WITH AT MOST THREE EDGES DELETED

Author(s)

LAU GEE CHOON | PENG YEE HOCK | ALIKHANI SAEID | Issue Writer Certificate

Keywords

CHROMATIC POLYNOMIAL

CHROMATIC UNIQUENESS

TURAN GRAPH

Abstract

Let P (G, l) be the CHROMATIC POLYNOMIAL of a graph G. A graph G is chromatically unique if for any graph H, P (H, l) = P(G, l) implies H is isomorphic to G. In this paper, we determine the chromaticity of all TURAN GRAPHs with at most three edges deleted. As a by product, we found many families of chromatically unique graphs and chromatic equivalence classes of graphs.

Cites

No record.

References

Cite

APA: Copy

LAU, GEE CHOON, PENG, YEE HOCK, & ALIKHANI, SAEID. (2014). CHROMATICITY OF TURAN GRAPHS WITH AT MOST THREE EDGES DELETED. IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI), 9(2), 45-64. SID. https://sid.ir/paper/310378/en

Vancouver: Copy

LAU GEE CHOON, PENG YEE HOCK, ALIKHANI SAEID. CHROMATICITY OF TURAN GRAPHS WITH AT MOST THREE EDGES DELETED. IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI)[Internet]. 2014;9(2):45-64. Available from: https://sid.ir/paper/310378/en

IEEE: Copy

GEE CHOON LAU, YEE HOCK PENG, and SAEID ALIKHANI, “CHROMATICITY OF TURAN GRAPHS WITH AT MOST THREE EDGES DELETED,” IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI), vol. 9, no. 2, pp. 45–64, 2014, [Online]. Available: https://sid.ir/paper/310378/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops