Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Randall J. Elzinga"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 2, Pp 467-493 (2020)
In this paper, we discuss various connections between the smallest eigenvalue of the adjacency matrix of a graph and its structure. There are several techniques for obtaining upper bounds on the smallest eigenvalue, and some of them are based on Rayl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93268dd769604b6ef4bd8af9611abbfa
Autor:
Sebastian M. Cioabă, Michelle Markiewitz, Trevor Vanderwoerd, Kevin N. Vander Meulen, Randall J. Elzinga
Graham and Pollak showed that the vertices of any connected graph $G$ can be assigned $t$-tuples with entries in $\{0, a, b\}$, called addresses, such that the distance in $G$ between any two vertices equals the number of positions in their addresses
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be145fcf4a220cd5efcb08707a5f0852
Autor:
Randall J. Elzinga, Sarah E. Vanderlinde, Kevin N. Vander Meulen, Michael S. Cavers, David A. Gregory
Publikováno v:
Discrete Mathematics. 308(15):3230-3240
We consider the minimum number of cliques needed to partition the edge set of D(G), the distance multigraph of a simple graph G. Equivalently, we seek to minimize the number of elements needed to label the vertices of a simple graph G by sets so that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::df50508c0758799447c64626ba745766
Autor:
Randall J. Elzinga
Publikováno v:
The Electronic Journal of Linear Algebra. 28
Let G be a graph and let A and D be the adjacency matrix of G and diagonal matrix of vertex degrees of G respectively. If each vertex degree is positive, then the normalized adjacency matrix of G is \hat{A} = D^(â1/2)AD^(â1/2). A classifica
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c6b283de0f03c042030866baa8c21489
https://doi.org/10.13001/1081-3810.2990
https://doi.org/10.13001/1081-3810.2990
Publikováno v:
Discrete Mathematics. 286:241-244
Motivated by a problem on message routing in communication networks, Graham and Pollak proposed a scheme for addressing the vertices of a graph G by N-tuples of three symbols in such a way that distances between vertices may readily be determined fro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ebe1c29a2dac36415afb910495839d5f
https://doi.org/10.1016/j.disc.2004.06.006
https://doi.org/10.1016/j.disc.2004.06.006
Autor:
Randall J. Elzinga, David A. Gregory
Publikováno v:
The Electronic Journal of Linear Algebra. 20
Weighted generalizations of Hoffman's ratio bound on the independence number of a regular graph are surveyed. Several known bounds are reviewed as special cases of modest extensions. Comparisons are made with the Shannon capacity �, Lovasz' paramet
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb41ddaa219798d490ed6d5d0485f727
https://doi.org/10.13001/1081-3810.1388
https://doi.org/10.13001/1081-3810.1388
Autor:
Randall J. Elzinga
Publikováno v:
The Electronic Journal of Linear Algebra. 10
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef9a8c4fa1228623bbf29de3ea8903d4
https://doi.org/10.13001/1081-3810.1110
https://doi.org/10.13001/1081-3810.1110