Results 31 to 40 of about 4,129,862 (348)

AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {25; 16; 1; 1; 8; 25}

open access: yesUral Mathematical Journal, 2017
Makhnev and Samoilenko have found parameters of strongly regular graphs with no more than 1000 vertices, which may be neighborhoods of vertices in antipodal distance-regular graph of diameter 3 and with  \(\lambda=\mu\).
Konstantin S. Efimov   +1 more
doaj   +1 more source

Non-existence of (76,30,8,14) strongly regular graph and some structural tools [PDF]

open access: yes, 2014
Our main result is the non-existence of strongly regular graph with parameters (76,30,8,14). We heavily use Euclidean representation of a strongly regular graph, and develop a number of tools that allow to establish certain structural properties of the ...
A. Bondarenko, A. Prymak, D. Radchenko
semanticscholar   +1 more source

The transition matroid of a 4-regular graph: An introduction [PDF]

open access: yesEuropean journal of combinatorics (Print), 2013
Given a 4-regular graph F , we introduce a binary matroid M ? ( F ) on the set of transitions of F . Parametrized versions of the Tutte polynomial of M ?
L. Traldi
semanticscholar   +1 more source

Regular Graphs are Antimagic

open access: yesThe Electronic Journal of Combinatorics, 2015
An undirected simple graph $G=(V,E)$ is called antimagic if there exists an injective function $f:E\rightarrow\{1,\dots,|E|\}$ such that $\sum_{e\in E(u)} f(e)\neq\sum_{e\in E(v)} f(e)$ for any pair of different nodes $u,v\in V$. In this note we prove — with a slight modification of an argument of Cranston et al. — that $k$-regular graphs are antimagic
Kristóf Bérczi   +2 more
openaire   +4 more sources

Regular divisor graph of finite commutative ring

open access: yesTikrit Journal of Pure Science, 2023
Let R be a finite commutative ring with identity 1. We introduce a new graph called regular divisor graph and denoted by . We classify the finite commutative ring to get a special graph and we are going to study some properties of this graph, clique ...
Payman Abbas Rashid, Hataw Saleem Rashid
doaj   +1 more source

Transitive distance-regular graphs from linear groups $L(3,q)$‎, ‎$q = 2,3,4,5$ [PDF]

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

Regular packings of regular graphs

open access: yesDiscrete Mathematics, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amauri Gutiérrez, Anna S. Lladó
openaire   +2 more sources

Counting Colorings of a Regular Graph [PDF]

open access: yesGraphs Comb., 2012
At most how many (proper) q-colorings does a regular graph admit? Galvin and Tetali conjectured that among all n-vertex, d-regular graphs with 2d|n, none admits more q-colorings than the disjoint union of n/2d copies of the complete bipartite graph Kd,d.
David J. Galvin
semanticscholar   +1 more source

About Regular Graphs

open access: yesFormalized Mathematics, 2023
Abstract In this article regular graphs, both directed and undirected, are formalized in the Mizar system [7], [2], based on the formalization of graphs as described in [10]. The handshaking lemma is also proven.
openaire   +2 more sources

Unavoidable parallel minors of regular matroids [PDF]

open access: yes, 2011
This is the post-print version of the Article - Copyright @ 2011 ElsevierWe prove that, for each positive integer k, every sufficiently large 3-connected regular matroid has a parallel minor isomorphic to M (K_{3,k}), M(W_k), M(K_k), the cycle matroid of
Chun, Carolyn   +5 more
core   +1 more source

Home - About - Disclaimer - Privacy