Results 81 to 90 of about 2,691 (126)

On the Laplacian index of tadpole graphs

open access: yesSpecial Matrices
In this article, we study the Laplacian index of tadpole graphs, which are unicyclic graphs formed by adding an edge between a cycle Ck{C}_{k} and a path Pn{P}_{n}.
Braga Rodrigo O., Veloso Bruno S.
doaj   +1 more source

An Odd Characterization of the Generalized Odd Graphs [PDF]

open access: yes
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

Spectrum of free-form Sudoku graphs

open access: yesOpen Mathematics, 2018
A free-form Sudoku puzzle is a square arrangement of m ×m cells such that the cells are partitioned into m subsets (called blocks) of equal cardinality. The goal of the puzzle is to place integers 1, . .
Abudayah Mohammad   +2 more
doaj   +1 more source

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

open access: yes
2000 Mathematics Subject Classification: 05C50, 05E99;graphs;spectral radius;diameter;limit points ...
Cioaba, S.M.   +3 more
core   +1 more source

The Minimal Spectral Radius of Graphs with a Given Diameter [PDF]

open access: yes
AMS classsifications: 05C50; 05E99; 94C15;graphs;spectral radius;diameter;networks;virus ...
Dam, E.R. van, Kooij, R.E.
core   +1 more source

Universal Adjacency Matrices with Two Eigenvalues [PDF]

open access: yes
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

A shorter proof of the distance energy of complete multipartite graphs

open access: yesSpecial Matrices, 2017
Caporossi, Chasser and Furtula in [Les Cahiers du GERAD (2009) G-2009-64] conjectured that the distance energy of a complete multipartite graph of order n with r ≥ 2 parts, each of size at least 2, is equal to 4(n − r).
So Wasin
doaj   +1 more source

Graphs whose Laplacian eigenvalues are almost all 1 or 2

open access: yesSpecial Matrices
We explicitly determine all connected graphs whose Laplacian matrices have at most four eigenvalues different from 1 and 2.
Mohammadian Ali, Xu Shanshan
doaj   +1 more source

Sombor spectra of chain graphs. [PDF]

open access: yesHeliyon, 2023
Imran M, Rather BA.
europepmc   +1 more source

Home - About - Disclaimer - Privacy