Results 1 to 10 of about 323,816 (328)
Contribution of directedness in graph spectra
In graph analyses, directed edges are often approximated to undirected ones so that the adjacency matrices may be symmetric. However, such a simplification has not been thoroughly verified. In this study, we investigate how directedness affects the graph
Masaki Ochi, Tatsuro Kawamoto
doaj +1 more source
THE SPECTRAL DETERMINATION OF THE MULTICONE GRAPHS Kw ▽ C WITH RESPECT TO THEIR SIGNLESS LAPLACIAN SPECTRA [PDF]
The main aim of this study is to characterize new classes of multicone graphs which are determined by their signless Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph.
A. Zeydi Abdian +2 more
doaj +1 more source
The spectral characterization of the connected multicone graphs
A multicone graph is defined to be the join of a clique and a regular graph. Let , and be natural numbers, and let and denote a complete graph and a complete bipartite graph, respectively.
Ali Zeydi Abdian +2 more
doaj +1 more source
Sombor spectra of chain graphs
We study the Sombor index and the Sombor spectral properties of chain graphs. In particular, an explicit formula for the Sombor index is given, the Sombor eigenvalues are discussed, bounds on the largest and the smallest Sombor eigenvalues are presented, chain graphs with the simple Sombor eigenvalue are characterized, formulae for the Frobenius norm ...
Muhammad Imran, Bilal Ahmad Rather
openaire +3 more sources
On the spectral determinations of the connected multicone graphs
In this study we investigate the spectra of the family of connected multicone graphs. A multicone graph is defined to be the join of a clique and a regular graph. Let , and be natural numbers, and let denote a complete graph on vertices.
Ali Zeydi Abdian +6 more
doaj +1 more source
Two Kinds of Laplacian Spectra and Degree Kirchhoff Index of the Weighted Corona Networks
Recently, the study related to network has aroused wide attention of the scientific community. Many problems can be usefully represented by corona graphs or networks.
Haiqin Liu, Yanling Shao
doaj +1 more source
On the distance spectra of m-generation n-prism graph
The distance matrix of a simple connected graph G is [Formula: see text] where dij is the length of a shortest path between the ith and jth vertices of G. Eigenvalues of D(G) are called the distance eigenvalues of G. The m-generation n-prism graph or (m,
Fouzul Atik +2 more
doaj +1 more source
The \(k\)-spectrum of a graph \(G\) is the set of all nonnegative integers that occur as the size of an induced \(k\)-vertex subgraph of \(G\). The authors determine the minimum order and size of a graph whose \(k\)-spectrum contains all the numbers \(0,1, \dots, {k \choose 2}\). They also study the sets that are \(k\)-spectra of some graphs.
Faudree, R.J. +4 more
openaire +1 more source
In classic graph signal processing, given a real-valued graph signal, its graph Fourier transform is typically defined as the series of inner products between the signal and each eigenvector of the graph Laplacian. Unfortunately, this definition is not mathematically valid in the cases of vector-valued graph signals which however are typical operands ...
Meng, Fanchao +2 more
openaire +2 more sources
SPECTRA OF GRAPH OPERATIONS BASED ON SPLITTING GRAPH
Summary: The splitting graph \(\mathrm{SP}(G)\) of a graph \(G\) is the graph obtained from \(G\) by taking a new vertex \(u'\) for each \(u \in V(G)\) and joining \(u'\) to all vertices of \(G\) adjacent to \(u \). For a connected regular graph \(G_1\) and an arbitrary regular graph \(G_2\), we determine the adjacency (respectively, Laplacian and ...
Lu, Zhiqin, Ma, Xiaoling, Zhang, Minshao
openaire +1 more source

