A Generalization of Clique Polynomials and Graph Homomorphism

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.

TEIMOORI H.; BAYAT M.

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

Journal Paper

Paper Information

Journal: JOURNAL OF MATHEMATICAL EXTENSION Year:2018 | Volume:12 | Issue:1 Page(s): 1-11

Download Full-Text

View:

262

Download:

205

Cites:

Information Journal Paper

Title

A Generalization of Clique Polynomials and Graph Homomorphism

Author(s)

TEIMOORI H. | BAYAT M. | Issue Writer Certificate

Keywords

Weighted clique polynomial

blow-up graph

No-Homomorphism criteria

Abstract

The clique polynomial of a graph G is the ordinary generating function of the number of complete subgraphs (cliques) of G. In this paper, we introduce a new vertex-weighted version of these polynomials. We also show that these Weighted clique polynomials have always a real root provided that the weights are non-negative real numbers. As an application, we obtain a No-Homomorphism criteria based on the largest real root of our vertex-Weighted clique polynomial.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

TEIMOORI, H., & BAYAT, M.. (2018). A Generalization of Clique Polynomials and Graph Homomorphism. JOURNAL OF MATHEMATICAL EXTENSION, 12(1), 1-11. SID. https://sid.ir/paper/720601/en

Vancouver: Copy

TEIMOORI H., BAYAT M.. A Generalization of Clique Polynomials and Graph Homomorphism. JOURNAL OF MATHEMATICAL EXTENSION[Internet]. 2018;12(1):1-11. Available from: https://sid.ir/paper/720601/en

IEEE: Copy

H. TEIMOORI, and M. BAYAT, “A Generalization of Clique Polynomials and Graph Homomorphism,” JOURNAL OF MATHEMATICAL EXTENSION, vol. 12, no. 1, pp. 1–11, 2018, [Online]. Available: https://sid.ir/paper/720601/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops