Results 51 to 60 of about 2,306 (105)

Asymptotic Results on the Spectral Radius and the Diameter of Graphs [PDF]

2000 Mathematics Subject Classification: 05C50, 05E99;graphs;spectral radius;diameter;limit points ...
Cioaba, S.M., Dam, E.R. van, Koolen, J.H., Lee, J.H.   +3 more
core   +1 more source

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   +1 more source

Divisible Design Graphs [PDF]

AMS Subject Classification: 05B05, 05E30, 05C50.Strongly regular graph;Group divisible design;Deza graph;(v;k ...
Haemers, W.H., Kharaghani, H., Meulenberg, M.A.   +2 more
core   +1 more source

The minimum exponential atom-bond connectivity energy of trees

Special Matrices
Let G=(V(G),E(G))G=\left(V\left(G),E\left(G)) be a graph of order nn. The exponential atom-bond connectivity matrix AeABC(G){A}_{{e}^{{\rm{ABC}}}}\left(G) of GG is an n×nn\times n matrix whose (i,j)\left(i,j)-entry is equal to ed(vi)+d(vj)−2d(vi)d(vj){e}^
Gao Wei
doaj   +1 more source

Universal Adjacency Matrices with Two Eigenvalues [PDF]

AMS Mathematics Subject Classification: 05C50.Adjacency matrix;Universal adjacency matrix;Laplacian matrix;signless Laplacian;Graph spectra;Eigenvalues;Strongly regular ...
Haemers, W.H., Omidi, G.R.
core   +1 more source

Potential counter-examples to a conjecture on the column space of the adjacency matrix

Special Matrices
Attempts to resolve the Akbari-Cameron-Khosrovshahi-conjecture have so far focused on the rank of a matrix. The conjecture claims that there exists a nonzero (0, 1)-vector in the row space of a (0, 1)-adjacency matrix A{\bf{A}} of a graph GG, that is not
Sciriha Irene, Kaur Bableen, Borg James L., Debono Mark   +3 more
doaj   +1 more source

The Maximum Order of Adjacency Matrices With a Given Rank [PDF]

AMS Subject Classification: 05B20, 05C50.Graph;Adjacency ...
Haemers, W.H., Peeters, M.J.P.
core   +1 more source

What is a proper graph Laplacian? An operator-theoretic framework for graph diffusion

Special Matrices
We introduce an operator-theoretic definition of a proper graph Laplacian as any matrix associated with a given graph that can be expressed as the composition of a divergence and a gradient operator, with the gradient acting between graph-related spaces ...
Estrada Ernesto
doaj   +1 more source

Uniformity in Association schemes and Coherent Configurations: Cometric Q-Antipodal Schemes and Linked Systems [PDF]

2010 Mathematics Subject Classification.
Dam, E.R. van, Martin, W.J., Muzychuk, M.   +2 more
core   +1 more source

Spectra of R-Vertex Join and R-Edge Join of Two Graphs

Discussiones Mathematicae - General Algebra and Applications, 2018
The R-graph R(G) of a graph G is the graph obtained from G by intro- ducing a new vertex ue for each e ∈ E(G) and making ue adjacent to both the end vertices of e. In this paper, we determine the adjacency, Lapla- cian and signless Laplacian spectra of R-
Das Arpita, Panigrahi Pratima
doaj   +1 more source