Abstract
AbstractFor a sequence of adjacency matrices, describing the unfolding of a network from the graph of a star, through graphs of a broom, to the graph of a link with constant vertices and edges, we ...
Highlights
Our study of how the leading eigenvalue, or the spectral radius, of an adjacency matrix of a network varies when the structure of the network changes is motivated by recent interests of research in how an infectious disease spreads over a network (Brauer, 2008; Diekmann & Heesterbeek, 2000; Newman, 2002, 2010)
In a network of agents susceptible to an infectious disease, assume that we know all details of the structure of the network: whether and how different agents are connected to each other
Citation information Cite this article as: Leading eigenvalues of adjacency matrices of star-like graphs with fixed numbers of vertices and edges, William D
Summary
Our study of how the leading eigenvalue, or the spectral radius, of an adjacency matrix of a network varies when the structure of the network changes is motivated by recent interests of research in how an infectious disease spreads over a network (Brauer, 2008; Diekmann & Heesterbeek, 2000; Newman, 2002, 2010).
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
