On Circulants Uniquely Characterized by their Independence Polynomials

No abstract is available for this paper.

• Publication year

  2012

• Venue

  Ars Comb.

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On Circulant Matrices

  2012cited by this paper
• Eigenvalues and Eigenvectors of Graphs

  2012cited by this paper
• The independence polynomial of a graph - a survey

  2005cited by this paper
• A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs

  2004cited by this paper
• Chromatically Unique Multibridge Graphs

  2004cited by this paper
• A Solution of the Isomorphism Problem for Circulant Graphs

  2004cited by this paper
• On Graphs Determined by Their Tutte Polynomials

  2004cited by this paper
• A new two-variable generalization of the chromatic polynomial

  2003cited by this paper
• On the roots of independence polynomials of almost all very well-covered graphs

  2003cited by this paper
• A survey on multi-loop networks

  2003cited by this paper
• Toida's Conjecture is True

  2002cited by this paper
• Combinatorics of Nonnegative Matrices

  2002cited by this paper
• 4-Circulant Graphs

  2002cited by this paper
• Algebraic Graph Theory

  2001cited by this paper
• Hardness Results and Spectral Techniques for Combinatorial Problems on Circulant Graphs

  1998cited by this paper
• Some families of chromatically unique bipartite graphs

  1998cited by this paper
• Some problems on chromatic polynomials

  1997cited by this paper
• The search for chromatically unique graphs - II

  1997cited by this paper
• Ádám's Conjecture is True in the Square-Free Case

  1995cited by this paper
• Distributed Loop Computer Networks: A Survey

  1995cited by this paper
• Clique polynomials and independent set polynomials of graphs

  1994cited by this paper
• Graphs determined by their reliability polynomial

  1988cited by this paper
• Cutpoints and the chromatic polynomial

  1984cited by this paper
• Circulants and their connectivities

  1984cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• Isomorphism of circulant graphs and digraphs

  1979cited by this paper
• Graphs with circulant adjacency matrices

  1970cited by this paper
• Twelve Geometric Essays

  1968cited by this paper

• On the roots of independence polynomials

  2019cites this paper
• C O ] 1 2 O ct 2 01 8 Independence Equivalence Classes of Paths and Cycles

  2018cites this paper
• Independence equivalence classes of paths and cycles

  2018cites this paper
• Squares and primitivity in partial words

  2015cites this paper
• A Graph Polynomial Approach to Primitivity

  2013cites this paper
• A way to construct independence equivalent graphs

  2012cites this paper
• Graph polynomials and their representations

  2012cites this paper