Results 31 to 40 of about 96,121 (306)
Spectra of Complemented Triangulation Graphs
Mathematics, 2022 The complemented triangulation graph of a graph G, denoted by CT(G), is defined as the graph obtained from G by adding, for each edge uv of G, a new vertex whose neighbours are the vertices of G other than u and v.
Jia Wei, Jing Wang
doaj +1 more source
On the Spectra of General Random Graphs [PDF]
The Electronic Journal of Combinatorics, 2011 We consider random graphs such that each edge is determined by an independent random variable, where the probability of each edge is not assumed to be equal. We use a Chernoff inequality for matrices to show that the eigenvalues of the adjacency matrix and the normalized Laplacian of such a random graph can be approximated by those of the weighted ...
Fan Chung Graham, Mary Radcliffe
openaire +2 more sources
Spectra of Orders for k-Regular Graphs of Girth g [PDF]
, 2021 A (k, g)-graph is a k-regular graph of girth g. Given k ≥ 2 and g ≥ 3, infinitely many (k, g)-graphs of infinitely many orders are known to exist. Our goal, for given k and g, is the classification of all orders n for which a (k, g)-graph of order n ...
Raiman Tom +3 more
core +1 more source
On the distance spectra of graphs
Linear Algebra and its Applications, 2016 20 pages, 3 figures v2.
Aalipour, Ghodratollah +10 more
openaire +4 more sources
Skew Spectra of Oriented Graphs [PDF]
The Electronic Journal of Combinatorics, 2009 An oriented graph $G^{\sigma}$ is a simple undirected graph $G$ with an orientation $\sigma$, which assigns to each edge a direction so that $G^{\sigma}$ becomes a directed graph. $G$ is called the underlying graph of $G^{\sigma}$, and we denote by $Sp(G)$ the adjacency spectrum of $G$.
Bryan L. Shader, Wasin So
openaire +2 more sources
Spectra of strongly Deza graphs [PDF]
Discrete Mathematics, 2021 A Deza graph $G$ with parameters $(n,k,b,a)$ is a $k$-regular graph with $n$ vertices such that any two distinct vertices have $b$ or $a$ common neighbours. The children $G_A$ and $G_B$ of a Deza graph $G$ are defined on the vertex set of $G$ such that every two distinct vertices are adjacent in $G_A$ or $G_B$ if and only if they have $a$ or $b$ common
Saieed Akbari +5 more
openaire +3 more sources
Local image descriptor based on spectral embedding
IET Computer Vision, 2015 This study presents a local image descriptor based on spectral embedding. Specifically, the spectra of line graph are used to represent image edges, corners and edge points with big curvature.
Pu Yan, Jun Tang, Ming Zhu, Dong Liang
doaj +1 more source
Graphs determined by signless Laplacian spectra
AKCE International Journal of Graphs and Combinatorics, 2020 In the past decades, graphs that are determined by their spectrum have received more attention, since they have been applied to several fields, such as randomized algorithms, combinatorial optimization problems and machine learning.
Ali Zeydi Abdian +2 more
doaj +1 more source
The spectra of arrangement graphs
Linear Algebra and its Applications, 2017 Arrangement graphs were introduced for their connection to computational networks and have since generated considerable interest in the literature. In a pair of recent articles by Chen, Ghorbani and Wong, the eigenvalues for the adjacency matrix of an (n,k)-arrangement graph are studied and shown to be integers.
Araujo, José O., Bratten, Tim
openaire +2 more sources
On the Spectra of Simplicial Rook Graphs [PDF]
Graphs and Combinatorics, 2013 The $\textit{simplicial rook graph}$ $SR(d,n)$ is the graph whose vertices are the lattice points in the $n$th dilate of the standard simplex in $\mathbb{R}^d$, with two vertices adjacent if they differ in exactly two coordinates. We prove that the adjacency and Laplacian matrices of $SR(3,n)$ have integral spectra for every $n$. We conjecture that $SR(
Jeremy L. Martin, Jennifer D. Wagner
openaire +4 more sources