Results 51 to 60 of about 1,557,851 (153)
On Locating-Dominating Set of Regular Graphs
Let G be a simple, connected, and finite graph. For every vertex v∈VG, we denote by NGv the set of neighbours of v in G. The locating-dominating number of a graph G is defined as the minimum cardinality of W ⊆ VG such that every two distinct vertices u,v∈
Anuwar Kadir Abdul Gafur +1 more
doaj +1 more source
Regular embeddings of complete bipartite maps: classification and enumeration
The regular embeddings of complete bipartite graphs Kn, n in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined.
Jones, Gareth
core +2 more sources
Construction of Cospectral Integral Regular Graphs
Graphs G and H are called cospectral if they have the same characteristic polynomial. If eigenvalues are integral, then corresponding graphs are called integral graph.
Bapat Ravindra B., Karimi Masoud
doaj +1 more source
Hamiltonian Strongly Regular Graphs [PDF]
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
Most switching classes with primitive automorphism groups contain graphs with trivial groups [PDF]
The operation of switching a graph Gamma with respect to a subset X of the vertex set interchanges edges and non-edges between X and its complement, leaving the rest of the graph unchanged.
Cameron, Peter Jephson +2 more
core +2 more sources
One note on the number of pairwise non-isomorphic connected regular graphs
In this paper, we give an explicit expression for the number of pairwise non-isomorphic connected regular graphs as well as odd graphs on n vertices, where [Formula: see text] is a positive integer.
Hailin Liu, Liping Zhong, Huixian Xu
doaj +1 more source
Regular graphs with four eigenvalues [PDF]
We study the connected regular graphs with four distinct eigenvalues. Properties and feasibility conditions of the eigenvalues are found. Several examples, constructions and characterizations are given, as well as some uniqueness and nonexistence results.
Dam, E.R. van
core
33-40In this paper, regular fuzzy graphs, total degree and totally regular fuzzy graphs are introduced. Regular fuzzy graphs and totally regular fuzzy graphs are compared through various examples. A necessary and sufficient condition under which they are
Gani, A.Nagoor, Radha, K.
core +1 more source
An Odd Characterization of the Generalized Odd Graphs [PDF]
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
Strongly Regular Graphs with Maximal Energy [PDF]
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Koolen and Moulton have proved that the energy of a graph on n vertices is at most n(1 + √n)/2, and that equality holds if and only if the graph is ...
Haemers, W.H.
core

