Threshold Sequences
From MaRDI portal
Publication:3964623
DOI10.1137/0602006zbMath0499.05059OpenAlexW4240884087MaRDI QIDQ3964623
Peter L. Hammer, Toshihide Ibaraki, Bruno Simeone
Publication date: 1981
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0602006
Related Items
Total matchings and total coverings of threshold graphs, Split graphs, Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\), Hamiltonian threshold graphs, Longest cycles in threshold graphs, Realizability and uniqueness in graphs, Multidimensional scaling and threshold graphs, Minimum edge ranking spanning trees of split graphs, Threshold Dimension of Graphs, Laplacian spectra and spanning trees of threshold graphs, Neighborhood degree lists of graphs, On vertex-weighted realizations of acyclic and general graphs, Theorems on partitioned matrices revisited and their applications to graph spectra, Forcibly bipartite and acyclic (uni-)graphic sequences, Graph realizations: maximum degree in vertex neighborhoods, Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps, Unnamed Item, Pseudodomishold graphs, The splittance of a graph, Graphs and degree sequences. I, Difference graphs, Contributions to the theory of graphic sequences, Bipartite bithreshold graphs, Adjacency relationships forced by a degree sequence, The polytope of degree sequences, Minimal Hamiltonian graphs with prescribed degree sets, Spectral Integral Variations of Degree Maximal Graphs, On forcibly hereditary P-graphical sequences, The principal Erdős-Gallai differences of a degree sequence, The realization graph of a degree sequence with majorization gap 1 is Hamiltonian, Degree sequences of matrogenic graphs, Once more on matrogenic graphs, P-antiregular graphs, Maximal graphs and graphs with maximal spectral radius, Relaxed and approximate graph realizations, Degree sequences and majorization, Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)
Cites Work
