Results 31 to 40 of about 587,527 (280)
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
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
We study the emergence of cooperation in structured populations with any arrangement of cooperators and defectors on the evolutionary graph. In a computational approach using structure coefficients defined for configurations describing such arrangements ...
Hendrik Richter
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
Regular Partitions of Regular Graphs [PDF]
In the study of the combinatorial structure of edge-graphs of convex polytopes one may ask whether a given graph possesses a partition consisting of certain kinds of subgraphs.In this paper we describe some special partitions of 3-valent and 4-valent graphs.
openaire +2 more sources
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
Existence of Regular Nut Graphs for Degree at Most 11
A nut graph is a singular graph with one-dimensional kernel and corresponding eigenvector with no zero elements. The problem of determining the orders n for which d-regular nut graphs exist was recently posed by Gauci, Pisanski and Sciriha.
Fowler Patrick W. +4 more
doaj +1 more source
Edge Regular Graph Products [PDF]
A regular nonempty graph $\Gamma$ is called edge regular, whenever there exists a nonegative integer $\lambda_{\Gamma}$, such that any two adjacent vertices of $\Gamma$ have precisely $\lambda_{\Gamma}$ common neighbours. An edge regular graph $\Gamma$ with at least one pair of vertices at distance 2 is called amply regular, whenever there exists a ...
Frelih, Boštjan, Miklavič, Štefko
openaire +3 more sources
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
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

