Some notes on the threshold graphs

In this paper we consider threshold graphs (also called nested split graphs) and investigate some invariants of these graphs which can be of interest in bounding the largest eigenvalue of some graph spectra.

Saved in:
Bibliographic Details
Published in:Discrete mathematics 2010-09, Vol.310 (17), p.2241-2248
Main Authors: ANDELIC, Milica, SIMIC, Slobodan K
Format: Article
Language:English
Subjects:
Adjacency matrix
Algebra
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computer science
control theory
systems
Eigenvalues
Exact sciences and technology
Graphs
Information retrieval. Graph
Invariants
Largest eigenvalue
Line graph
Mathematical analysis
Mathematics
Nested split graph
Numerical analysis
Numerical analysis. Scientific computation
Numerical linear algebra
Sciences and techniques of general use
Signless Laplacian
Spectra
Theoretical computing
Threshold graph
Thresholds
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we consider threshold graphs (also called nested split graphs) and investigate some invariants of these graphs which can be of interest in bounding the largest eigenvalue of some graph spectra.
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2010.04.022