Results 11 to 20 of about 40,584 (295)
Hamiltonian Strongly Regular Graphs [PDF]
SSRN Electronic Journal, 2008 We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices.
Brouwer, A.E., Haemers, W.H.
core +8 more sources
Some Chemistry Indices of Clique-Inserted Graph of a Strongly Regular Graph
Complexity, 2021 In this paper, we give the relation between the spectrum of strongly regular graph and its clique-inserted graph. The Laplacian spectrum and the signless Laplacian spectrum of clique-inserted graph of strongly regular graph are calculated.
Chun-Li Kan +3 more
doaj +2 more sources
Journal of Combinatorial Theory, Series A, 1985 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rudolf Mathon, Alexander Rosa
openaire +3 more sources
A directed graph version of strongly regular graphs
Journal of Combinatorial Theory, Series A, 1988 The paper gives existence and nonexistence conditions of a directed graph version of strongly regular graphs whose adjacency matrices satisfy the equations \[ A^ 2+(u-v)A-(t-u)I=uJ\quad \] \[ AJ=JA=kJ \] where A is the adjacency matrix, I the identity matrix, J the matrix of all l's and u, v, t, k are the parameters.
Duval, Art M, Duval, Art M.
openaire +4 more sources
DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {27, 20, 7; 1, 4, 21} DOES NOT EXIST
Ural Mathematical Journal, 2020 In the class of distance-regular graphs of diameter 3 there are 5 intersection arrays of graphs with at most 28 vertices and noninteger eigenvalue. These arrays are \(\{18,14,5;1,2,14\}\), \(\{18,15,9;1,1,10\}\), \(\{21,16,10;1,2,12\}\), \(\{24,21,3;1,3 ...
Konstantin S. Efimov +1 more
doaj +1 more source
MASALAH EIGEN DAN EIGENMODE MATRIKS ATAS ALJABAR MIN-PLUS
Barekeng, 2021 Eigen problems and eigenmode are important components related to square matrices. In max-plus algebra, a square matrix can be represented in the form of a graph called a communication graph.
Eka Widia Rahayu +2 more
doaj +1 more source
Cyclotomy and Strongly Regular Graphs [PDF]
Journal of Algebraic Combinatorics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brouwer, A. E. +2 more
openaire +3 more sources
AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {39; 36; 4; 1; 1; 36}
Ural Mathematical Journal, 2018 Makhnev and Nirova have found intersection arrays of distance-regular graphs with no more than \(4096\) vertices, in which \(\lambda=2\) and \(\mu=1\). They proposed the program of investigation of distance-regular graphs with \(\lambda=2\) and \(\mu=1\)
Konstantin S. Efimov +1 more
doaj +1 more source
A unique and novel graph matrix for efficient extraction of structural information of networks
Electronic Journal of Graph Theory and Applications, 2021 In this article, we propose a new type of square matrix associated with an undirected graph by trading off the natural embedded symmetry in them. The proposed matrix is defined using the neighbourhood sets of the vertices, called as neighbourhood matrix
Sivakumar Karunakaran +1 more
doaj +1 more source
On the Complexity of Identifying Strongly Regular Graphs [PDF]
Australas. J Comb., 2022 New result- GI is not AC0-reducible to isomorphism testing of conference graphs; fixed minor bugs and typos from previous ...
openaire +3 more sources