Results 1 to 10 of about 370,627 (270)
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.Distance-regular graphs;Hamilton cycles JEL ...
Brouwer, A.E., Haemers, W.H.
core +7 more sources
Strongly walk-regular graphs [PDF]
Journal of Combinatorial Theory, Series A, 2013 We study a generalization of strongly regular graphs. We call a graph strongly walk-regular if there is an $\ell >1$ such that the number of walks of length $\ell$ from a vertex to another vertex depends only on whether the two vertices are the same ...
Abreu +15 more
core +5 more sources
D-magic strongly regular graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 For a set of distances D, a graph G on n vertices is said to be D-magic if there exists a bijection and a constant k such that for any vertex x, where is the D-neighbourhood set of x.
Rinovia Simanjuntak, Palton Anuwiksa
doaj +3 more sources
Homomorphisms of Strongly Regular Graphs [PDF]
Algebraic Combinatorics, 2016 We prove that if $G$ and $H$ are primitive strongly regular graphs with the same parameters and $\varphi$ is a homomorphism from $G$ to $H$, then $\varphi$ is either an isomorphism or a coloring (homomorphism to a complete subgraph).
Roberson, David E.
core +4 more sources
On strongly regular graphs with m2 = qm3 and m3 = qm2 for q = 7/2, 7/3, 7/4, 7/5, 7/6 [PDF]
Yugoslav Journal of Operations Research, 2021 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 τ and θ such that |Si ∩ Sj| = τ for any two adjacent vertices i and j, and |Si ∩ Sj| = θ for any
Lepović Mirko
doaj +1 more source
The application domain of difference type matrix D(r,0,s,0,t) on some sequence spaces [PDF]
Yugoslav Journal of Operations Research, 2021 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 τ and θ such that |Si ∩ Sj | = τ for any two adjacent vertices i and j, and |Si ∩ Sj | = θ for any two ...
Paul Avinoy, Tripathy Binod Chandra
doaj +1 more source
ON DISTANCE–REGULAR GRAPHS OF DIAMETER 3 WITH EIGENVALUE \(\theta=1\)
Ural Mathematical Journal, 2022 For a distance-regular graph \(\Gamma\) of diameter 3, the graph \(\Gamma_i\) can be strongly regular for \(i=2\) or 3. J.Kulen and co-authors found the parameters of a strongly regular graph \(\Gamma_2\) given the intersection array of the graph ...
Alexander A. Makhnev +2 more
doaj +1 more source
On r-Edge Regular Neutrosophic Graphs [PDF]
Neutrosophic Sets and Systems, 2023 We approach learning characteristic on a neutrosophic graph such as r-edge regular neutrosophic graph, strongly edge regular neutrosophic graph and absolute degree of vertex since a neutrosophic set 𝑁𝑆 = {〈𝑥, 𝑁𝑆𝔗(𝑥), 𝑁𝑆𝔩 (𝑥), 𝑁𝑆𝔉(𝑥)〉; 𝑥 ∈ 𝑋} of a ...
M. Kaviyarasu
doaj +1 more source
Transitive distance-regular graphs from linear groups $L(3,q)$, $q = 2,3,4,5$ [PDF]
Transactions on Combinatorics, 2020 In this paper we classify distance-regular graphs, including strongly regular graphs, admitting a transitive action of the linear groups $L(3,2)$, $L(3,3)$, $L(3,4)$ and $L(3,5)$ for which the rank of the permutation representation is at most 15.
Andrea Svob
doaj +1 more source
An upper bound for difference of energies of a graph and its complement
Examples and Counterexamples, 2023 The A-energy of a graph G, denoted by EA(G), is defined as sum of the absolute values of eigenvalues of adjacency matrix of G. Nikiforov in Nikiforov (2016) proved that EA(G¯)−EA(G)≤2μ¯1and EA(G)−EA(G¯)≤2μ1for any graph G and posed a problem to find best
Harishchandra S. Ramane +2 more
doaj +1 more source