Near Threshold Graphs

2Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

A conjecture of Grone and Merris states that for any graph G, its Laplacian spectrum, A(G), is majorized by its conjugate degree sequence, D* (G). That conjecture prompts an investigation of the relationship between A(G) and D* (G), and Merris has characterized the graphs G for which the multisets A(G) and D* (G) are equal. In this paper, we provide a constructive characterization of the graphs G for which A(G) and D* (G) share all but two elements.

Cite

CITATION STYLE

APA

Kirkland, S. (2009). Near Threshold Graphs. Electronic Journal of Combinatorics, 16(1). https://doi.org/10.37236/131

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free