Results 241 to 250 of about 119,419 (266)

Regularity of Congruential Graphs

2000
The aim of this article is to make a link between the congruential systems investigated by Conway and the infinite graphs theory. We compare the graphs of congruential systems with a well known family of infinite graphs: the regular graphs of finite degree considered by Muller and Shupp, and by Courcelle.
openaire   +1 more source

Circumference of a regular graph

Journal of Graph Theory, 1989
AbstractIt is proved that a 4‐connected, δ‐regular graph G either is Hamiltonian, or has at least 3δ + 1 vertices and contains a cycle of length at least min{4δ ‐ 4, 1/2 (|G| + 3δ ‐ 2)}. Examples supplied by B. Jackson and H.A. Jung show that min{4δ ‐ 4, 1/2(|G| + 3δ ‐ 2)} cannot be replaced by 4δ + 1.
openaire   +2 more sources

Domination in regular graphs

Ars Comb., 1996
A two-valued function \(f\) defined on the vertices of a graph \(G=(V,E)\), \(f:V\rightarrow \{-1,1\}\), is a signed dominating function if the sum of its function values over any closed neighborhood is at least one. It is a majority dominating function if this holds true for at least half of the neighborhoods.
openaire   +1 more source

Decycling regular graphs [PDF]

Australas. J Comb., 2005
If \(G\) is a graph and \(S\) is a set of vertices of \(G\) such that \(G-S\) is acyclic, then \(S\) is called decycling set of \(G\). The cardinality of the smallest decycling set of \(G\) is called the decycling number of \(G\) and it is denoted by \(\phi(G)\). It is shown, that if \({\mathbf d}\) is a fixed graphic degree sequence and \({\mathcal R}(
openaire   +1 more source

A walk-regular graph, cospectral to its complement, need not be strongly regular

Discrete Mathematics, 2023
Sanja Stevanovic, Dragan Stevanovic
exaly  

There is no (95, 40, 12, 20) strongly regular graph

Journal of Combinatorial Designs, 2020
Jernej Azarija, Tilen Marc
exaly  

On the E-Optimality of Regular Graph Designs

Journal of the Royal Statistical Society Series B: Statistical Methodology, 1980
Mike Jacroux
exaly  

Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph

Graphs and Combinatorics, 2007
Michael A Henning, Anders Yeo, Henning Michael A   +2 more
exaly  

Arc-transitive abelian regular covers of the Heawood graph

Journal of Algebra, 2013
Marston Conder, Jicheng Ma
exaly  

An inequality involving the second largest and smallest eigenvalue of a distance-regular graph

Linear Algebra and Its Applications, 2011
Jack H Koolen, Jongyook Park
exaly