Results 31 to 40 of about 1,557,851 (153)
Regular star complements in strongly regular graphs [PDF]
We prove that, aside from the complete multipartite graphs and graphs of Steiner type, there are only finitely many connected strongly regular graphs with a regular star complement of prescribed degree s∈N.
Peter Rowlinson, Rowlinson, Peter
core +1 more source
Constructing signed strongly regular graphs via star complement technique
We consider signed graphs, i.e., graphs with positive or negative signs on their edges. The notion of signed strongly regular graph is recently defined by the author (Signed strongly regular graphs, Proceeding of 48th Annual Iranian Mathematical ...
F. Ramezani
doaj +1 more source
On edge product cordial graphs [PDF]
An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we characterize graphs admitting an edge product cordial labeling.
Jaroslav Ivančo
doaj +1 more source
On single-valued co-neutrosophic graphs [PDF]
In this paper, we introduce the notion of a single-valued co-neutrosophic graphs and study some methods of construction of new single-valued co-neutrosophic graphs.
R. Dhavaseelan +3 more
doaj +1 more source
On pseudo regular spherical fuzzy graphs
In this paper, pseudo regular and totally pseudo regular spherical fuzzy graphs are defined using pseudo degree and total pseudo degree of a vertex. A necessary and sufficient condition for pseudo regular spherical fuzzy graph is given.
B Mohamed Harif, A Nazeera Begam
doaj +1 more source
End-regularity of generalized bicycle graph
A graph G is called End-regular, if every endomorphism of G is regular as a monoid. In this article, we investigate End-regularity of bicycle graphs.
A. Rajabi, A. Erfanian, A. Azimi
doaj +1 more source
Quasi-randomness and algorithmic regularity for graphs with general degree distributions [PDF]
We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to express how much a given graph “resembles” a random one.
Schacht, Mathias +5 more
core +1 more source
On Automorphisms of a Distance-Regular Graph with Intersection Array {125,96,1;1,48,125} [PDF]
J. Koolen posed the problem of studying distance-regular graphs in which neighborhoods of vertices are strongly regular graphs with the second eigenvalue ≤ t for the given positive integer t.
V.V. Bitkina, A.A. Makhnev
doaj
Star complements in regular graphs: Old and new results [PDF]
We survey results concerning star complements in finite regular graphs, and note the connection with designs and strongly regular graphs in certain cases.
Rowlinson, Peter, Tayfeh-Rezaie, Behruz
core +1 more source
New concepts of regular and (highly) irregular vague graphs with applications
In this paper, some types of vague graphs are introdaced such as dm-regular, tdm-regular, m-highly irregular and m-highly totally irregular vague graphs are introduced and some properties of them are discussed.
Elham Darabian +3 more
doaj +1 more source

