scientific article
From MaRDI portal
Publication:3835498
zbMath0679.05061MaRDI QIDQ3835498
Yousef Alavi, Allen J. Schwenk, Paresh J. Malde, Paul Erdős
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Independence Equivalence Classes of Paths and Cycles ⋮ Log-concavity of some independence polynomials via a partial ordering ⋮ Clique cover products and unimodality of independence polynomials ⋮ The average domination polynomial of graphs is unimodal ⋮ Bernoulli trials of fixed parity, random and randomly oriented graphs ⋮ Unimodality of independence polynomials of the incidence product of graphs ⋮ Building graphs whose independence polynomials have only real roots ⋮ On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs ⋮ On the location of roots of independence polynomials ⋮ On the unimodality of independence polynomials of some graphs ⋮ Unimodality of independence polynomials of the cycle cover product of graphs ⋮ Independent set and matching permutations ⋮ On real-rootedness of independence polynomials of rooted products of graphs ⋮ The roller-coaster conjecture revisited ⋮ On the unimodality of independence polynomials of very well-covered graphs ⋮ General position polynomials ⋮ The cyclomatic number of a graph and its independence polynomial at \(- 1\) ⋮ Two problems on independent sets in graphs ⋮ The independent set sequence of regular bipartite graphs ⋮ A way to construct independence equivalent graphs ⋮ Independent sets in graphs ⋮ On the shape of a pure 𝑂-sequence ⋮ Maximal-clique partitions and the roller coaster conjecture ⋮ Bounds on the number of complete subgraphs ⋮ Acyclic polynomials of graphs ⋮ Counting Markov equivalence classes for DAG models on trees ⋮ A simple proof of an inequality connecting the alternating number of independent sets and the decycling number ⋮ A note on purely imaginary independence roots ⋮ Log-concavity of independence polynomials of some kinds of trees ⋮ Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture ⋮ The independent set sequence of some families of trees ⋮ On trees with real-rooted independence polynomial ⋮ Unimodality of independence polynomials of rooted products of graphs ⋮ On the independent set sequence of a tree ⋮ Unimodality of the independence polynomials of non-regular caterpillars ⋮ Roots of independence polynomials of well covered graphs ⋮ Unimodality of the independence polynomials of some composite graphs ⋮ Almost unimodal and real-rooted graph polynomials ⋮ On the unimodality of average edge cover polynomials ⋮ On the independence polynomial of the corona of graphs
