Cover Image

There are finitely many uniformly most reliable graphs of corank 5

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Romero, Pablo
Format:	Preprint
Published:	2024
Subjects:	Combinatorics 05C31
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Characterization of locally most split reliable graphs
by: Romero, Pablo
Published: (2025)

Existence of most reliable two-terminal graphs with distance constraints
by: Romero, Pablo
Published: (2025)

Existence, uniqueness and construction of locally most reliable two-terminal graphs
by: Romero, Pablo
Published: (2025)

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)

Density of reliability roots of simple graphs in the unit disk
by: Buys, Pjotr
Published: (2026)

Counting subgraphs of coloring graphs
by: Asgarli, Shamil, et al.
Published: (2024)

A study on $T$-equivalent graphs
by: Dong, Fengming, et al.
Published: (2025)

On the boundary polynomial of a graph
by: Carballosa, Walter, et al.
Published: (2025)

Comparing list-color functions of uniform hypergraphs with their chromatic polynomials
by: Dong, Fengming, et al.
Published: (2023)

Partial-dual genus polynomial of graphs
by: Cheng, Zhiyun
Published: (2025)

Polynomial invariants of cyclically ordered graphs
by: Bratch, Paul, et al.
Published: (2025)

Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (III)
by: Dong, Fengming, et al.
Published: (2022)

Generalized block diagonal Laplacian spectrum of graphs
by: Xu, Yanrui, et al.
Published: (2025)

On the most reliable graphs with fixed redundancy
by: Brand, Rotem, 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)

Zero-freeness of a multivariate monomer-dimer-cycle polynomial on bounded-degree graphs
by: Coutinho, Gabriel, et al.
Published: (2026)

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)

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)

Visibility polynomial of corona of two graphs
by: B, Tonny K, et al.
Published: (2025)

Visibility in graphs under edge and vertex removal
by: Dokyeesun, Pakanun, et al.
Published: (2025)

Counterexamples to two conjectures on mean color numbers of graphs
by: Zhai, Wushuang, et al.
Published: (2024)

Independence polynomials of graphs
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)

A note on graphs of $k$-colourings
by: Hogan, Emma, et al.
Published: (2024)

A one-line proof of a minimax theorem (for a notion of curvature on finite graphs)
by: Huang, Yi C.
Published: (2024)

Successive vertex orderings of connected graphs
by: Agrawal, Prarthana, et al.
Published: (2026)

Computing the permanental polynomial of $4k$-intercyclic bipartite graphs
by: Bapat, Ravindra B., et al.
Published: (2024)

The domination polynomial of powers of paths and cycles
by: Galvin, David, et al.
Published: (2024)

A remark on the Whitney Broken Circuit Theorem
by: Fialho, Paula M. S., et al.
Published: (2024)

Expansions of the Potts model partition function along deletions and contractions
by: Takahashi, Ryo
Published: (2024)

The Degree Polynomial
by: Brown, Jason I., et al.
Published: (2025)

Transition polynomial as a weight system for binary delta-matroids
by: Dunaykin, Alexander, et al.
Published: (2019)

Degree Sequences vs. Forests in Bipartite Graphs
by: Grinberg, Darij, et al.
Published: (2026)

On a conjecture concerning the property of chromatic polynomials with negative variables
by: Yang, Yan
Published: (2026)

Galois coverings of Schreier graphs of groups generated by bounded automata
by: Shaikh, Asif, et al.
Published: (2017)

Construction of infinitely many trace-minimal graphs with maximum number of spanning trees
by: Romero, Pablo, et al.
Published: (2025)

Counting subgraphs of coloring graphs using shadow graphs
by: MacLean, Simon
Published: (2025)

Characteristic polynomials of semimatroids and their connections to matroids, hyperplane arrangements and graph colorings
by: Fu, Houshan
Published: (2025)

Polynomials Counting Group Colorings in Graphs
by: Fu, Houshan
Published: (2024)