Saved in:
| Main Author: | Romero, Pablo |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.16514 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Existence of most reliable two-terminal graphs with distance constraints
by: Romero, Pablo
Published: (2025)
by: Romero, Pablo
Published: (2025)
Characterization of locally most split reliable graphs
by: Romero, Pablo
Published: (2025)
by: Romero, Pablo
Published: (2025)
There are finitely many uniformly most reliable graphs of corank 5
by: Romero, Pablo
Published: (2024)
by: Romero, Pablo
Published: (2024)
An algebraic characterization of strong graphs
by: Romero, Pablo
Published: (2024)
by: Romero, Pablo
Published: (2024)
A characterization of graphs with at most four boundary vertices
by: Chiem, Nick, et al.
Published: (2022)
by: Chiem, Nick, et al.
Published: (2022)
Density of reliability roots of simple graphs in the unit disk
by: Buys, Pjotr
Published: (2026)
by: Buys, Pjotr
Published: (2026)
Visibility polynomial of corona of two graphs
by: B, Tonny K, et al.
Published: (2025)
by: B, Tonny K, et al.
Published: (2025)
Counterexamples to two conjectures on mean color numbers of graphs
by: Zhai, Wushuang, et al.
Published: (2024)
by: Zhai, Wushuang, et al.
Published: (2024)
On the most reliable graphs with fixed redundancy
by: Brand, Rotem, et al.
Published: (2026)
by: Brand, Rotem, et al.
Published: (2026)
A study on $T$-equivalent graphs
by: Dong, Fengming, et al.
Published: (2025)
by: Dong, Fengming, et al.
Published: (2025)
On the boundary polynomial of a graph
by: Carballosa, Walter, et al.
Published: (2025)
by: Carballosa, Walter, et al.
Published: (2025)
Counting subgraphs of coloring graphs
by: Asgarli, Shamil, et al.
Published: (2024)
by: Asgarli, Shamil, et al.
Published: (2024)
Partial-dual genus polynomial of graphs
by: Cheng, Zhiyun
Published: (2025)
by: Cheng, Zhiyun
Published: (2025)
Polynomial invariants of cyclically ordered graphs
by: Bratch, Paul, et al.
Published: (2025)
by: Bratch, Paul, et al.
Published: (2025)
Generalized block diagonal Laplacian spectrum of graphs
by: Xu, Yanrui, et al.
Published: (2025)
by: Xu, Yanrui, et al.
Published: (2025)
A relation between the cube polynomials of partial cubes and the clique polynomials of their crossing graphs
by: Xie, Yan-Ting, et al.
Published: (2023)
by: Xie, Yan-Ting, et al.
Published: (2023)
Zero-freeness of a multivariate monomer-dimer-cycle polynomial on bounded-degree graphs
by: Coutinho, Gabriel, et al.
Published: (2026)
by: Coutinho, Gabriel, et al.
Published: (2026)
On the zero-free region for the chromatic polynomial of graphs with maximum degree $Δ$ and girth $g$
by: Fialho, Paula M. S., et al.
Published: (2024)
by: Fialho, Paula M. S., et al.
Published: (2024)
Visibility in graphs under edge and vertex removal
by: Dokyeesun, Pakanun, et al.
Published: (2025)
by: Dokyeesun, Pakanun, et al.
Published: (2025)
On the zero-free region for the chromatic polynomial of claw-free graphs with and without induced square and induced diamond
by: Fialho, Paula M. S., et al.
Published: (2026)
by: Fialho, Paula M. S., et al.
Published: (2026)
Independence polynomials of graphs
by: Hibi, Takayuki, et al.
Published: (2026)
by: Hibi, Takayuki, et al.
Published: (2026)
On the independent set polynomial of graphs and claw-free graphs
by: Fialho, Paula M. S., et al.
Published: (2025)
by: Fialho, Paula M. S., et al.
Published: (2025)
A note on graphs of $k$-colourings
by: Hogan, Emma, et al.
Published: (2024)
by: Hogan, Emma, et al.
Published: (2024)
Successive vertex orderings of connected graphs
by: Agrawal, Prarthana, et al.
Published: (2026)
by: Agrawal, Prarthana, et al.
Published: (2026)
Computing the permanental polynomial of $4k$-intercyclic bipartite graphs
by: Bapat, Ravindra B., et al.
Published: (2024)
by: Bapat, Ravindra B., et al.
Published: (2024)
Counting subgraphs of coloring graphs using shadow graphs
by: MacLean, Simon
Published: (2025)
by: MacLean, Simon
Published: (2025)
Counting with two-level polynomials
by: Bogart, Tristram, et al.
Published: (2025)
by: Bogart, Tristram, et al.
Published: (2025)
Galois coverings of Schreier graphs of groups generated by bounded automata
by: Shaikh, Asif, et al.
Published: (2017)
by: Shaikh, Asif, et al.
Published: (2017)
Characteristic polynomials of semimatroids and their connections to matroids, hyperplane arrangements and graph colorings
by: Fu, Houshan
Published: (2025)
by: Fu, Houshan
Published: (2025)
Partial Petrial polynomials for complete graphs and paths
by: Yan, Qi, et al.
Published: (2025)
by: Yan, Qi, et al.
Published: (2025)
Characterizing circle graphs with binomial partial Petrial polynomials
by: Feng, Ruiqing, et al.
Published: (2025)
by: Feng, Ruiqing, et al.
Published: (2025)
The two-variable hypergraph Tutte polynomial via embedding activities
by: Tóthmérész, Lilla
Published: (2023)
by: Tóthmérész, Lilla
Published: (2023)
A note on the Independent domination polynomial of zero divisor graph of rings
by: Rather, Bilal Ahmad
Published: (2024)
by: Rather, Bilal Ahmad
Published: (2024)
Reconstructing hypergraph matching polynomials
by: Kim, Donggyu, et al.
Published: (2025)
by: Kim, Donggyu, et al.
Published: (2025)
Tensor product formulas for the Bollobás-Riordan and Krushkal polynomials
by: Moffatt, Iain, et al.
Published: (2025)
by: Moffatt, Iain, et al.
Published: (2025)
A quasi-tree expansion for the surface Tutte polynomial
by: Thompson, Maya
Published: (2025)
by: Thompson, Maya
Published: (2025)
On the Visibility Polynomial of Graphs
by: B, Tonny K, et al.
Published: (2025)
by: B, Tonny K, et al.
Published: (2025)
New Perspectives On The Unimodality Of Domination Polynomials
by: Omar, Mohamed
Published: (2026)
by: Omar, Mohamed
Published: (2026)
Contractible independence complexes of trees
by: Pham, My Hanh, et al.
Published: (2026)
by: Pham, My Hanh, et al.
Published: (2026)
Hypergraph independence polynomials with a zero close to the origin
by: Zhang, Shengtong
Published: (2023)
by: Zhang, Shengtong
Published: (2023)
Similar Items
-
Existence of most reliable two-terminal graphs with distance constraints
by: Romero, Pablo
Published: (2025) -
Characterization of locally most split reliable graphs
by: Romero, Pablo
Published: (2025) -
There are finitely many uniformly most reliable graphs of corank 5
by: Romero, Pablo
Published: (2024) -
An algebraic characterization of strong graphs
by: Romero, Pablo
Published: (2024) -
A characterization of graphs with at most four boundary vertices
by: Chiem, Nick, et al.
Published: (2022)