Split graphs

Authors:
Russell Merris
Affiliations:
Department of Mathematics and Computer Science, California State University, Hayward, CA
Venue:
European Journal of Combinatorics
Year:
2003

Citing 7
Cited 1

Hamiltonian threshold graphs

Discrete Applied Mathematics
Strict 2-threshold graphs

Discrete Applied Mathematics
Seven criteria for integer sequences bring graphic

Journal of Graph Theory
The Erdős-Gallai criterion and symmetric functions

European Journal of Combinatorics
Switching Distance Between Graphs with the Same Degrees

SIAM Journal on Discrete Mathematics
Decomposition of graphical sequences and unigraphs

Discrete Mathematics
On homotopy of connected graphs having the same degree function

Discrete Mathematics

Dynamically maintaining split graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main topics of this article are split graphs, their degree sequences, and the place of these "split partitions" at the top of the partially ordered set of graphic partitions. One application is that threshold covered partitions are unigraphic.