On maximum graphs in Tutte polynomial posets

DOI10.1016/J.DAM.2023.06.018MaRDI QIDQ6064837zbMATH OpenOpenAlexFDO

Authors Nathan Kahl, Kristi Luttrell

Publication date 11 December 2023

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2023.06.018

zbMATH Keywords

all-terminal reliabilitychromatic polynomialextremal graphsorientationsTutte polynomial

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph polynomials (05C31) Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07) Reliability, availability, maintenance, inspection in operations research (90B25) Programming involving graphs or networks (90C35)

Recommendations

• Extremal graphs for the Tutte polynomial
• Upper maximal graphs of posets
• On graphs determined by their Tutte polynomials
• Tutte sets in graphs. II: The complexity of finding maximum Tutte sets
• Several extreme coefficients of the Tutte polynomial of graphs
• On the maximal independence polynomial of certain graph configurations
• On the Tutte and Matching Polynomials for Complete Graphs
• Generalizing Tutte's theorem and maximal non-matchable graphs
• Tutte sets in graphs I: Maximal tutte sets and D-graphs
• Maxima for Graphs and a New Proof of a Theorem of Turán

Cites work

• A proof of Boesch's conjecture
• A Survey of Network Reliability and Domination Theory
• A survey of some network reliability analysis and synthesis results
• Acyclic and totally cyclic orientations of combinatorial geometries
• Acyclic orientations of graphs
• Chip firing and the Tutte polynomial
• Combinatorial optimization problems in the analysis and design of probabilistic networks
• Computing Tutte polynomials
• Crossing properties of graph reliability functions
• Extremal graphs for the Tutte polynomial
• Fourientations and the Tutte polynomial
• Graph polynomials and their applications. I: The Tutte polynomial
• scientific article; zbMATH DE number 3784908 (Why is no real title available?)
• scientific article; zbMATH DE number 67324 (Why is no real title available?)
• scientific article; zbMATH DE number 1943957 (Why is no real title available?)
• scientific article; zbMATH DE number 1369835 (Why is no real title available?)
• Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
• Nonexistence of optimal graphs for all terminal reliability
• On graphs with randomly deleted edges
• On the existence of uniformly optimally reliable networks
• On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
• Partial graph orientations and the Tutte polynomial
• Reliability polynomials can cross twice
• The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions
• Uniformly-most reliable networks do not always exist

Cited in

(6)

• Upper maximal graphs of posets
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Most reliable graphs with reduced corank
• An algebraic characterization of strong graphs
• Characterization of locally most split reliable graphs
• Corrigendum to: ``On maximum graphs in Tutte polynomial posets

This page was built for publication: On maximum graphs in Tutte polynomial posets

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