Clique polynomials have a unique root of smallest modulus

DOI10.1016/S0020-0190(00)00086-7MaRDI QIDQ294815zbMATH OpenWikidataFDO

Authors Massimiliano Goldwurm, Massimo Santini

Publication date 16 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019000000867?np=y

zbMATH Keywords

clique polynomialsformal languagesrational functionstrace monoids

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1229629
• On a class of polynomials associated with the cliques in a graph and its applications
• Clique roots of K₄-free chordal graphs
• scientific article; zbMATH DE number 1123931
• Clique polynomials and independent set polynomials of graphs

Cites work

• Combinatorial problems of commutation and rearrangements
• Determinants and Möbius functions in trace monoids
• scientific article; zbMATH DE number 4058887 (Why is no real title available?)
• scientific article; zbMATH DE number 41838 (Why is no real title available?)
• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• scientific article; zbMATH DE number 1972790 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 3226832 (Why is no real title available?)
• scientific article; zbMATH DE number 3346572 (Why is no real title available?)
• Membership problems for regular and context-free trace languages
• Möbius functions and confluent semi-commutations
• Non-negative matrices and Markov chains. 2nd ed

Cited in

(31)

• Computing the average parallelism in trace monoids.
• Toward uniform random generation in 1-safe Petri nets
• A cut-invariant law of large numbers for random heaps
• Möbius inversion formula for the trace group
• Synchronization of Bernoulli sequences on shared letters
• A spectral property for concurrent systems and some probabilistic applications
• Number of prefixes in trace monoids: clique polynomials and dependency graphs
• Deterministic concurrent systems
• Markovian dynamics of concurrent systems
• A logician's view of graph polynomials
• One more remark on the adjoint polynomial
• On the roots of independence polynomials of almost all very well-covered graphs
• Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture
• Semantic equivalence of graph polynomials definable in second order logic
• On the growth of deviations
• The clique density theorem
• On the Minimal Density of Triangles in Graphs
• On the KŁR conjecture in random graphs
• Growth rates of geometric grid classes of permutations
• Note on the smallest root of the independence polynomial
• Uniform and Bernoulli measures on the boundary of trace monoids
• Introduction to Probabilistic Concurrent Systems
• The exact minimum number of triangles in graphs with given order and size
• Entropy and the clique polynomial
• A new algorithm for compression of partially commutative alphabets
• A note on extremal constructions for the Erdős-Rademacher problem
• Ergodic properties of concurrent systems
• Disconnected common graphs via supersaturation
• On the location of roots of graph polynomials
• Building graphs whose independence polynomials have only real roots
• On the dependence polynomial of a graph

This page was built for publication: Clique polynomials have a unique root of smallest modulus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294815)