Threshold graphs and related topics
From MaRDI portal
This monograph on threshold graphs contains nineteen well-written chapters. Chapter 1: Threshold graphs, Chapter 2: Ferrers digraphs and difference graphs, Chapter 3: Degree sequences, Chapter 4: Applications, Chapter 5: Split graphs, Chapter 6: The threshold dimension, Chapter 7: NP-completeness, Chapter 8: 2-threshold graphs, Chapter 9: The Dilworth number, Chapter 10: Box-threshold graphs, Chapter 11: Matroidal and matrogenic graphs, Chapter 12: Domishold graphs, Chapter 13: The decomposition method, Chapter 14: Pseudothreshold and equistable graphs, Chapter 15: Threshold weights and measures, Chapter 16: Threshold graphs and order relations, Chapter 17: Enumeration, Chapter 18: Extremal problems, and Chapter 19: Other extensions. A glance at the extensive and up-to-date bibliography indicates the relevance of this book to researchers in the area of threshold graphs.
Recommendations
Cited in
(only showing first 100 items - show all)- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
- Specializations of Ferrers ideals
- Extreme values of the sum of squares of degrees of bipartite graphs
- Cubicity of threshold graphs
- Undirected simple connected graphs with minimum number of spanning trees
- Probe threshold and probe trivially perfect graphs
- Threshold hypergraphs
- The complexity of some problems related to GRAPH 3-COLORABILITY
- The realization graph of a degree sequence with majorization gap 1 is Hamiltonian
- Hamiltonian powers in threshold and arborescent comparability graphs
- Enumerative aspects of certain subclasses of perfect graphs
- Random walks and hyperplane arrangements
- Matrix sandwich problems
- Dot product representations of graphs
- Equistable series-parallel graphs
- Equistable chordal graphs
- A fully dynamic algorithm for modular decomposition and recognition of cographs.
- Maximal graphs and graphs with maximal spectral radius
- The polytope of degree sequences of hypergraphs
- No threshold graphs are cospectral
- Mock threshold graphs
- On the distance spectra of threshold graphs
- Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations
- On the emergence of scale-free production networks
- The isomorphic version of Brualdi's and Sanderson's nestedness
- Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm
- Fast algorithms for indices of nested split graphs approximating real complex networks
- Sublinear approximation algorithms for boxicity and related problems
- On dynamic threshold graphs and related classes
- G-parking functions and tree inversions
- Efficient counting of degree sequences
- Graph vulnerability parameters, compression, and quasi-threshold graphs
- Adjacency relationships forced by a degree sequence
- Extremal threshold graphs for matchings and independent sets
- Spectral characterizations of anti-regular graphs
- Binomial edge ideals of regularity 3
- Perfectness of clustered graphs
- A vertex ordering characterization of simple-triangle graphs
- Paired threshold graphs
- Supersolvable frame-matroid and graphic-lift lattices
- Split graphs
- Laplacian spectra and spanning trees of threshold graphs
- Interval graph limits
- Face numbers of centrally symmetric polytopes produced from Split graphs
- On the eigenvalues distribution in threshold graphs
- The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
- On the normalized spectrum of threshold graphs
- On characterizations for subclasses of directed co-graphs
- Pairwise stable networks in homogeneous societies with weak link externalities
- Forbidden subgraphs of power graphs
- Representing graphs as the intersection of cographs and threshold graphs
- On main eigenvalues of chain graphs
- Algorithmic aspects of Roman domination in graphs
- Group-annihilator graphs realised by finite abelian groups and its properties
- On the eccentricity spectra of threshold graphs
- The principal Erdős-Gallai differences of a degree sequence
- Idiosyncratic preferences in games on networks
- Local public goods with weighted link formation
- Cliques in realization graphs
- Hereditary classes of graphs: a parametric approach
- The Burge correspondence and crystal graphs
- On monoid graphs
- Extension of threshold graphs under complex fuzzy environment
- On bipartite graphs having minimum fourth adjacency coefficient
- Notes on Hamiltonian threshold and chain graphs
- Matching orderable and separable hypergraphs
- A lower bound on the saturation number, and graphs for which it is sharp
- Eigenvalue-free interval for Seidel matrices of threshold graphs
- Complex Pythagorean fuzzy threshold graphs with application in petroleum replenishment
- Hardness results of connected power domination for bipartite graphs and chordal graphs
- Representing split graphs by words
- Combinatorics, graph theory, and computing
- Double-threshold permutation graphs
- Deciding atomicity of subword-closed languages
- Spanning tree enumeration and nearly triangular graph Laplacians
- Betti numbers and anti-lecture Hall compositions of random threshold graphs
- Exact square coloring of certain classes of graphs: complexity and algorithms
- The role of the anti-regular graph in the spectral analysis of threshold graphs
- Homomorphisms into loop-threshold graphs
- Characterizing threshold graphs with k main signless Laplacian eigenvalues
- The signless Laplacian spectral radius of graphs with a prescribed number of edges
- Net Laplacian controllability for joins of signed graphs
- Perfect Italian domination on planar and regular graphs
- \(b\)-vectors of chordal graphs
- Graph vulnerability parameters, compression, and threshold graphs
- Distance eigenvalues of a cograph and their multiplicities
- A conjecture on the eigenvalues of threshold graphs
- Each (n,m)-graph having the i-th minimal Laplacian coefficient is a threshold graph
- The Moore-Penrose inverse of symmetric matrices with nontrivial equitable partitions
- On pairwise compatibility graphs having Dilworth number k
- Stable-\(\Pi\) partitions of graphs
- Laplacian controllability classes for threshold graphs
- Graphs with maximal signless Laplacian spectral radius
- On the reduced signless Laplacian spectrum of a degree maximal graph
- Equistable graphs, general partition graphs, triangle graphs, and graph products
- The \(L(2,1)\)-labeling of unigraphs
- Algorithmic aspects of upper paired-domination in graphs
- Sandwiches missing two ingredients of order four
- Fractional revival of threshold graphs under Laplacian dynamics
- A note on the eigenvalue free intervals of some classes of signed threshold graphs
This page was built for publication: Threshold graphs and related topics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1899209)
