On the spectrum of threshold graphs (Q410640): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / review text | |||
Summary: The antiregular connected graph on \(r\) vertices is defined as the connected graph whose vertex degrees take the values of \(r - 1\) distinct positive integers. We explore the spectrum of its adjacency matrix and show common properties with those of connected threshold graphs, having an equitable partition with a minimal number \(r\) of parts. Structural and combinatorial properties can be deduced for related classes of graphs and in particular for the minimal configurations in the class of singular graphs. | |||
Property / review text: Summary: The antiregular connected graph on \(r\) vertices is defined as the connected graph whose vertex degrees take the values of \(r - 1\) distinct positive integers. We explore the spectrum of its adjacency matrix and show common properties with those of connected threshold graphs, having an equitable partition with a minimal number \(r\) of parts. Structural and combinatorial properties can be deduced for related classes of graphs and in particular for the minimal configurations in the class of singular graphs. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C40 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C07 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6021213 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
antiregular connected graph | |||
Property / zbMATH Keywords: antiregular connected graph / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58688687 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.5402/2011/108509 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2161425649 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4228232 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4165164 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithmic graph theory and perfect graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Threshold graphs and related topics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4526775 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph Classes: A Survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a class of posets and the corresponding comparability graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a property of the class of n-colorable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dacey Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3166466 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Linear Recognition Algorithm for Cographs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3910567 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the spectral radius of (0,1)-matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3739148 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On nested split graphs whose second largest eigenvalue is less than 1 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A characterization of singular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the construction of graphs of nullity one / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximal core size in singular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The rank of a cograph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A table of connected graphs on six vertices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some results on graph spectra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2895336 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4327350 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Antiregular graphs are universal for trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs and matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Grone-Merris Conjecture / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 00:45, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the spectrum of threshold graphs |
scientific article |
Statements
On the spectrum of threshold graphs (English)
0 references
3 April 2012
0 references
Summary: The antiregular connected graph on \(r\) vertices is defined as the connected graph whose vertex degrees take the values of \(r - 1\) distinct positive integers. We explore the spectrum of its adjacency matrix and show common properties with those of connected threshold graphs, having an equitable partition with a minimal number \(r\) of parts. Structural and combinatorial properties can be deduced for related classes of graphs and in particular for the minimal configurations in the class of singular graphs.
0 references
antiregular connected graph
0 references
0 references