Click for new scientific resources and news about Corona[COVID-19]

Paper Information

Journal:   JOURNAL OF MATHEMATICAL EXTENSION   2018 , Volume 12 , Number 1; Page(s) 1 To 11.
 
Paper: 

A Generalization of Clique Polynomials and Graph Homomorphism

 
 
Author(s):  TEIMOORI H.*, BAYAT M.
 
* Department of Mathematics and Computer Science, Allameh Tabatabai University Tehran, iran
 
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.
 
Keyword(s): Weighted clique polynomial,blow-up graph,No-Homomorphism criteria
 
 
References: 
  • Not Registered.
  •  
  •  
 
Citations: 
  • Not Registered.
 
+ Click to Cite.
APA: Copy

TEIMOORI, H., & BAYAT, M. (2018). A Generalization of Clique Polynomials and Graph Homomorphism. JOURNAL OF MATHEMATICAL EXTENSION, 12(1), 1-11. https://www.sid.ir/en/journal/ViewPaper.aspx?id=668561



Vancouver: Copy

TEIMOORI H., BAYAT M.. A Generalization of Clique Polynomials and Graph Homomorphism. JOURNAL OF MATHEMATICAL EXTENSION. 2018 [cited 2021October26];12(1):1-11. Available from: https://www.sid.ir/en/journal/ViewPaper.aspx?id=668561



IEEE: Copy

TEIMOORI, H., BAYAT, M., 2018. A Generalization of Clique Polynomials and Graph Homomorphism. JOURNAL OF MATHEMATICAL EXTENSION, [online] 12(1), pp.1-11. Available: https://www.sid.ir/en/journal/ViewPaper.aspx?id=668561.



 
  pdf-File
Yearly Visit 67
 
 
Latest on Blog
Enter SID Blog