Image de couverture de livre

Symmetric and unimodal independence polynomials of trees

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hibi, Takayuki, Kara, Selvi, Vien, Dalena
Format:	Preprint
Publié:	2026
Sujets:	Combinatorics 05C30, 05C31
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Pseudo-Gorenstein$^{*}$ Graphs
par: Hibi, Takayuki, et autres
Publié: (2026)

Independence polynomials of graphs
par: Hibi, Takayuki, et autres
Publié: (2026)

Algebraic Invariants of Edge Ideals Under Suspension
par: Kara, Selvi, et autres
Publié: (2026)

Linear recurrences for non-log-concave independence polynomials of trees
par: Bautista-Ramos, César, et autres
Publié: (2026)

Closed-form expansions for the universal edge elimination polynomial
par: Dohmen, Klaus
Publié: (2014)

Visibility polynomial of corona of two graphs
par: B, Tonny K, et autres
Publié: (2025)

Multiple breaks of log-concavity in the independence polynomials of trees
par: Bautista-Ramos, César
Publié: (2025)

Comparing list-color functions of uniform hypergraphs with their chromatic polynomials
par: Dong, Fengming, et autres
Publié: (2023)

Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (III)
par: Dong, Fengming, et autres
Publié: (2022)

A q-analogue of graph independence polynomials with a group-theoretic interpretation
par: Qiao, Youming
Publié: (2024)

Contractible independence complexes of trees
par: Pham, My Hanh, et autres
Publié: (2026)

Principal minors of tree distance matrices
par: Richman, Harry, et autres
Publié: (2024)

Partial Petrial polynomials for complete graphs and paths
par: Yan, Qi, et autres
Publié: (2025)

Hypergraph independence polynomials with a zero close to the origin
par: Zhang, Shengtong
Publié: (2023)

Characterizing circle graphs with binomial partial Petrial polynomials
par: Feng, Ruiqing, et autres
Publié: (2025)

Distinguishing Polynomials of Graphs
par: Haghighi, Mohammad Hassan Shirdareh, et autres
Publié: (2024)

Counterexamples to two conjectures on mean color numbers of graphs
par: Zhai, Wushuang, et autres
Publié: (2024)

Visibility Polynomial of Some Graph Classes
par: B, Tonny K, et autres
Publié: (2025)

A quasi-tree expansion for the surface Tutte polynomial
par: Thompson, Maya
Publié: (2025)

Chromatic symmetric functions and polynomial invariants of trees
par: Aliste-Prieto, José, et autres
Publié: (2024)

Cardinalities of the total number of independent sets
par: Kovács, Benedek, et autres
Publié: (2025)

The 3-state Potts model on planar triangulations: explicit algebraic solution
par: Bousquet-Mélou, Mireille, et autres
Publié: (2025)

Successive vertex orderings of connected graphs
par: Agrawal, Prarthana, et autres
Publié: (2026)

Density of reliability roots of simple graphs in the unit disk
par: Buys, Pjotr
Publié: (2026)

Genus distribution polynomials for bicellular bicolored maps all with real zeros
par: Bai, Zi-Wei, et autres
Publié: (2024)

Meta-theorems for Graph Polynomials
par: Makowsky, Johann A.
Publié: (2024)

Realizable (reg, deg h)-Pairs for Cover Ideals via Independence Polynomials
par: Biermann, Jennifer, et autres
Publié: (2026)

A relation between the cube polynomials of partial cubes and the clique polynomials of their crossing graphs
par: Xie, Yan-Ting, et autres
Publié: (2023)

Reconstructing hypergraph matching polynomials
par: Kim, Donggyu, et autres
Publié: (2025)

On the boundary polynomial of a graph
par: Carballosa, Walter, et autres
Publié: (2025)

A note on the log-concavity of parking functions
par: Pappe, Joseph
Publié: (2024)

Partial Petrial Polynomials of Ribbon Graphs
par: Yu, Xiaoxiang, et autres
Publié: (2026)

Partial-dual genus polynomial of graphs
par: Cheng, Zhiyun
Publié: (2025)

Tensor product formulas for the Bollobás-Riordan and Krushkal polynomials
par: Moffatt, Iain, et autres
Publié: (2025)

On the minimum number of maximal distance-$k$ independent sets in trees
par: Taletskii, Dmitrii
Publié: (2026)

The bipartite analogue of a classical spanning tree enumeration formula, Boolean functions, and their applications to counting odd spanning trees
par: Ge, Jun, et autres
Publié: (2026)

On the independent set polynomial of graphs and claw-free graphs
par: Fialho, Paula M. S., et autres
Publié: (2025)

Nordhaus-Gaddum inequalities for the number of 1-nearly independent vertex subsets
par: Andriantiana, Eric O. D., et autres
Publié: (2026)

The Kneser chromatic function distinguishes trees
par: Nishimura, Yusaku
Publié: (2024)

Defective chromatic polynomials
par: Asgarli, Shamil, et autres
Publié: (2026)