Show simple item record

dc.contributor.author Goldberg, F.
dc.contributor.author Kirkland, S.
dc.contributor.author Varghese, A.
dc.contributor.author Vijayakumar, A.
dc.date.accessioned 2020-07-31T15:58:06Z
dc.date.available 2020-07-31T15:58:06Z
dc.date.issued 2020
dc.date.submitted 2020-07-31T01:13:12Z en_US
dc.identifier.uri http://hdl.handle.net/1993/34814
dc.description.abstract It is a well-known fact that a graph of diameter d has at least d + 1 eigenvalues. A graph is d-extremal, if it has diameter d and exactly d+1 eigenvalues. A graph is split if its vertex set can be partitioned into a clique and a stable set. Such graphs have diameter at most 3. We obtain a complete classification of the connected bidegreed 3-extremal split graphs using the association of split graphs with combinatorial designs. We also construct certain families of non-bidegreed 3-extremal split graphs. en_US
dc.description.sponsorship NSERC grant number RGPIN/6123-2014. Science Foundation Ireland grant number SFI/07/SK/I1216b. en_US
dc.language.iso en en_US
dc.publisher Discrete Applied Mathematics en_US
dc.rights info:eu-repo/semantics/restrictedAccess
dc.subject Adjacency matrix en_US
dc.subject Split graph en_US
dc.subject Bidegreed graph en_US
dc.subject Combinatorial design en_US
dc.title On split graphs with four distinct eigenvalues en_US
dc.type Article en_US
dc.type info:eu-repo/semantics/article
dc.status yes


Files in this item

This item appears in the following Collection(s)

Show simple item record

View Statistics