ON THE DOMINATION POLYNOMIALS OF NON P4-FREE 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.

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:2013 | Volume:8 | Issue:2 Page(s): 49-55

Download Full-Text

View:

497

Download:

171

Cites:

Information Journal Paper

Title

ON THE DOMINATION POLYNOMIALS OF NON P4-FREE GRAPHS

Author(s)

ALIKHANI SAEID | Issue Writer Certificate

Keywords

DOMINATION POLYNOMIAL

SIMPLE PATH

ROOT

Abstract

A graph G is called P4-free, if G does not contain an induced subgraph P4. The DOMINATION POLYNOMIAL of a graph G of order n is the polynomial D (G, x)=Sni=1d (G, i) xi, where d (G, i) is the number of dominating sets of G of size i. Every ROOT of D (G, x) is called a domination ROOT of G. In this paper we state and prove formula for the DOMINATION POLYNOMIAL of non P4-free graphs. Also, we pose a conjecture about domination ROOTs of these kind of graphs.

Cites

CHROMATICITY OF TURAN GRAPHS WITH AT MOST THREE EDGES DELETED

References

Cite

APA: Copy

ALIKHANI, SAEID. (2013). ON THE DOMINATION POLYNOMIALS OF NON P₄-FREE GRAPHS. IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI), 8(2), 49-55. SID. https://sid.ir/paper/310366/en

Vancouver: Copy

ALIKHANI SAEID. ON THE DOMINATION POLYNOMIALS OF NON P₄-FREE GRAPHS. IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI)[Internet]. 2013;8(2):49-55. Available from: https://sid.ir/paper/310366/en

IEEE: Copy

SAEID ALIKHANI, “ON THE DOMINATION POLYNOMIALS OF NON P₄-FREE GRAPHS,” IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI), vol. 8, no. 2, pp. 49–55, 2013, [Online]. Available: https://sid.ir/paper/310366/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops