On Circulants Uniquely Characterized by their Independence Polynomials

被引：0
作者：
Brown, Jason [1 ]
Hoshino, Richard [1 ]
机构：
[1] Dalhousie Univ, Dept Math & Stat, Halifax, NS B3H 3J5, Canada
来源：
ARS COMBINATORIA | 2012年 / 104卷
关键词：
circulant graph; matching polynomial; chromatic polynomial; independence polynomial; threshold graphs; spider graphs; GRAPHS; ISOMORPHISM; CONJECTURE;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In [18], Farrell and Whitehead investigate circulant graphs that are uniquely characterized by their matching and chromatic polynomials (i.e., graphs that are "matching unique" and "chromatic unique"). They develop a partial classification theorem, by finding all matching unique and chromatic unique circulants on n vertices, for each n <= 8. In this paper, we explore circulant graphs that are uniquely characterized by their independence polynomials. We obtain a full classification theorem by proving that a circulant is independence unique if it is the disjoint union of isomorphic complete graphs.
引用
收藏
页码：363 / 374
页数：12
相关论文
共 38 条
  • [1] Independence polynomials of circulants with an application to music
    Brown, Jason
    Hoshino, Richard
    DISCRETE MATHEMATICS, 2009, 309 (08) : 2292 - 2304
  • [2] Circulants and critical points of polynomials
    Kushel, Olga
    Tyaglov, Mikhail
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2016, 439 (02) : 634 - 650
  • [3] Computing the Matching Polynomials and Independence Polynomials of Phenylene Chains
    Chen, Hanlin
    Gao, Xiang
    INTERNATIONAL JOURNAL OF QUANTUM CHEMISTRY, 2025, 125 (01)
  • [4] Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs
    Lass, Bodo
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2012, 102 (02) : 411 - 423
  • [5] On Symmetry of Independence Polynomials
    Levit, Vadim E.
    Mandrescu, Eugen
    SYMMETRY-BASEL, 2011, 3 (03): : 472 - 486
  • [6] On the Stability of Independence Polynomials
    Brown, Jason, I
    Cameron, Ben
    ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (01)
  • [7] Optimal Graphs for Independence and k-Independence Polynomials
    J. I. Brown
    D. Cox
    Graphs and Combinatorics, 2018, 34 : 1445 - 1457
  • [8] Optimal Graphs for Independence and k-Independence Polynomials
    Brown, J. I.
    Cox, D.
    GRAPHS AND COMBINATORICS, 2018, 34 (06) : 1445 - 1457
  • [9] On the zeroes of hypergraph independence polynomials
    Galvin, David
    Mckinley, Gwen
    Perkins, Will
    Sarantis, Michail
    Tetali, Prasad
    COMBINATORICS PROBABILITY AND COMPUTING, 2024, 33 (01) : 65 - 84
  • [10] Bears with Hats and Independence Polynomials
    Blazej, Vaclav
    Dvorak, Pavel
    Opler, Michal
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2023, 25 (02)
1234