Threshold graphs and related topics
zbMATH Open0852.05001MaRDI QIDQ1899209FDOQ1899209
Authors: N. V. R. Mahadev, Uri N. Peled
Publication date: 9 October 1995
Published in: Annals of Discrete Mathematics (Search for Journal in Brave)
Recommendations
decompositionenumerationextremal problemsNP-completenesssplit graphsthreshold graphsdegree sequencesdifference graphsDilworth numberFerrers digraphsthreshold weights
Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02)
Cited In (only showing first 100 items - show all)
- Title not available (Why is that?)
- On pairwise compatibility graphs having Dilworth number \(k\)
- Eigenvalue-free interval for threshold graphs
- Rank‐tolerance graph classes
- Complexity issues of perfect secure domination in graphs
- On König graphs with respect to \(P_4\)
- Linear separation of connected dominating sets in graphs
- On bipartite graphs having minimum fourth adjacency coefficient
- Oriented threshold graphs
- Flow polytopes and the space of diagonal harmonics
- Graph vulnerability parameters, compression, and quasi-threshold graphs
- Extension of threshold graphs under complex fuzzy environment
- The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
- Representing split graphs by words
- Algorithmic aspects of upper paired-domination in graphs
- Pairwise compatibility graphs: a survey
- Neighborhood degree lists of graphs
- Maximality of the signless Laplacian energy
- Matching orderable and separable hypergraphs
- On characterizations for subclasses of directed co-graphs
- Extremal threshold graphs for matchings and independent sets
- The Burge correspondence and crystal graphs
- 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
- Pairwise stable networks in homogeneous societies with weak link externalities
- The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial
- Separable and equatable hypergraphs
- Spectral properties of cographs and \(P_5\)-free graphs
- Eigenvalue-free intervals of distance matrices of threshold and chain graphs
- Title not available (Why is that?)
- Algorithmic complexity of weakly connected Roman domination in graphs
- Spectral characterizations of anti-regular graphs
- Fast algorithms for indices of nested split graphs approximating real complex networks
- Decomposing 1-Sperner hypergraphs
- Total vertex-edge domination in graphs: Complexity and algorithms
- Algorithmic Aspects of Quasi-Total Roman Domination in Graphs
- On main eigenvalues of chain graphs
- The principal Erdős-Gallai differences of a degree sequence
- Fractional revival of threshold graphs under Laplacian dynamics
- Characterizing threshold graphs with \(k\) main signless Laplacian eigenvalues
- Net Laplacian controllability for joins of signed graphs
- The Moore-Penrose inverse of symmetric matrices with nontrivial equitable partitions
- A vertex ordering characterization of simple-triangle graphs
- Vertex types in threshold and chain graphs
- Algorithmic complexity of secure connected domination in graphs
- Chain graphs with simple Laplacian eigenvalues and their Laplacian dynamics
- Group-annihilator graphs realised by finite abelian groups and its properties
- On the eccentricity spectra of threshold graphs
- Idiosyncratic preferences in games on networks
- Local public goods with weighted link formation
- Efficiently realizing interval sequences
- Efficient counting of degree sequences
- Algorithmic aspects of outer independent Roman domination in graphs
- Cliques in realization graphs
- Injective coloring of some subclasses of bipartite graphs and chordal graphs
- Persuasion in networks: public signals and cores
- On dynamic threshold graphs and related classes
- Recognizing Graphs Close to Bipartite Graphs
- Threshold graphs, shifted complexes, and graphical complexes
- A characterization of claw-free \(b\)-perfect graphs
- Exact square coloring of certain classes of graphs: complexity and algorithms
- Sublinear approximation algorithms for boxicity and related problems
- Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
- A note on chromatic properties of threshold graphs
- The signless Laplacian spectral radius of graphs with a prescribed number of edges
- Some notes on the threshold graphs
- Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case
- Results on the small quasi-kernel conjecture
- Matrix sandwich problems
- Edge contractions in subclasses of chordal graphs
- The efficiency and stability of R\&D networks
- Unit and single point interval graphs
- \(\lambda\)-coloring matrogenic graphs
- Graphs with the maximum or minimum number of 1-factors
- A short constructive proof of the Erdős-Gallai characterization of graphic lists
- Algorithmic aspects of Roman domination in graphs
- Extreme values of the sum of squares of degrees of bipartite graphs
- A fully dynamic algorithm for modular decomposition and recognition of cographs.
- Cographs: eigenvalues and Dilworth number
- Split graphs
- On random trees obtained from permutation graphs
- Re-conceptualizing centrality in social networks
- Polar cographs
- Hamiltonian powers in threshold and arborescent comparability graphs
- Complexity aspects of restrained Roman domination in graphs
- Residual reliability of P-threshold graphs
- Hardness and approximation results of Roman \{3\}-domination in graphs
- The asymptotics of the geometric polynomials
- Cubicity of threshold graphs
- On split-coloring problems
- Bipartite graphs with the maximum sum of squares of degrees
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
- Title not available (Why is that?)
- Enumerative aspects of certain subclasses of perfect graphs
- A characterization of chain probe graphs
- On a class of graphs between threshold and total domishold graphs
- On bounds for the index of double nested graphs
- Laplacian spectra and spanning trees of 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)