Clique polynomials and independent set polynomials of graphs
Selected papers of the 13th British Combinatorial Conference on British combinatorial conference
A unified approach to the first derivatives of graph polynomials
Discrete Applied Mathematics
Roots of Independence Polynomials of Well Covered Graphs
Journal of Algebraic Combinatorics: An International Journal
State of the art of graph-based data mining
ACM SIGKDD Explorations Newsletter
On the Location of Roots of Independence Polynomials
Journal of Algebraic Combinatorics: An International Journal
Average independence polynomials
Journal of Combinatorial Theory Series B
The roots of the independence polynomial of a clawfree graph
Journal of Combinatorial Theory Series B
On the roots of independence polynomials of almost all very well-covered graphs
Discrete Applied Mathematics
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
The Co-2-plex Polytope and Integral Systems
SIAM Journal on Discrete Mathematics
A parallel algorithm for enumerating all the maximal k-plexes
PAKDD'07 Proceedings of the 2007 international conference on Emerging technologies in knowledge discovery and data mining
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
Operations Research
| Hi-index | 0.00 |
This paper offers a generalization of the independence polynomial, the co-k-plex polynomial. The resulting family of polynomials carries combinatorial information on a class of independence systems defined over the vertex set of a finite graph. Specifically, we offer a recursion formula and examples of the co-2-plex polynomial on certain graphs. In addition, we characterize the class of graphs whose co-2-plex polynomial will have all real roots.