Results 91 to 100 of about 279 (161)
An Odd Characterization of the Generalized Odd Graphs [PDF]
2010 Mathematics Subject Classification: 05E30, 05C50;distance-regular graphs;generalized odd graphs;odd-girth;spectra of graphs;spectral excess theorem;spectral ...
Dam, E.R. van, Haemers, W.H.
core
Spectral Bayesian network theory. [PDF]
Linear Algebra Appl, 2023 Duttweiler L, Thurston SW, Almudevar A.
europepmc +1 more source
Cospectral Graphs and the Generalized Adjacency Matrix [PDF]
AMS classifications: 05C50; 05E99;cospectral graphs;generalized spectrum;generalized adjacency ...
Koolen, J.H. +2 more
core
On the spectral radius and energy of the degree distance matrix of a connected graph
Open MathematicsLet GG be a simple connected graph on nn vertices. The degree of a vertex v∈V(G)v\in V\left(G), denoted by dv{d}_{v}, is the number of edges incident with vv and the distance between any two vertices u,v∈V(G)u,v\in V\left(G), denoted by duv{d}_{uv}, is ...
Khan Zia Ullah, Hameed Abdul
doaj +1 more source
Spectral dynamics of guided edge removals and identifying transient amplifiers for death-Birth updating. [PDF]
J Math Biol, 2023 Richter H.
europepmc +1 more source
AMS Subject Classification: 05B05, 05E30, 05C50.Strongly regular graph;Group divisible design;Deza graph;(v;k ...
Kharaghani, H. +2 more
core
Kernels of directed graph Laplacians [PDF]
, 2020 . Let G denote a directed graph with adjacency matrix Q and in-degree matrix D. We consider the Kirchhoff matrix L = D−Q, sometimes referred to as the directed Laplacian. A classical result of Kirchhoff asserts that when G is undirected, the multiplicity
J S Caughman, J J P Veerman
core
On strongly regular graphs with m2 = qm3 and m3 = qm2 [PDF]
, 2011 2010 Mathematics Subject Classification: 05C50.We say that a regular graph G of order n and degree r і 1 (which is not the complete graph) is strongly regular if there exist non-negative integers t and q such that |SiЗSj| = t for any two adjacent ...
Lepovic, Mirko
core
A Laplacian eigenbasis for threshold graphs
Special MatricesLet GG be a graph on nn vertices. In this article, we prove that an eigenbasis of the Laplacian matrix of a star graph of order nn is also an eigenbasis of GG if and only if GG is a threshold graph. As an application of this spectral characterization, we
Macharete Rafael R. +3 more
doaj +1 more source
, 2008 We define the harmonic evolution of states of a graph by iterative application of the harmonic operator (Laplacian over Z2). This provides graphs with a new geometric context and leads to a new tool to analyze them.
Jerzy Kocik
core