Results 1 to 10 of about 96,525 (309)
Regular Colorings in Regular Graphs
Discussiones Mathematicae Graph Theory, 2020 An (r − 1, 1)-coloring of an r-regular graph G is an edge coloring (with arbitrarily many colors) such that each vertex is incident to r − 1 edges of one color and 1 edge of a different color.
Bernshteyn Anton +6 more
doaj +3 more sources
Probabilistic regular graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extension of regular graphs obtained by labelling the terminal arcs of the graph ...
Christophe Morvan, Nathalie Bertrand
doaj +5 more sources
End-regularity of generalized bicycle graph
AKCE International Journal of Graphs and Combinatorics, 2020 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 +2 more sources
The construction of all nonisomorphic minimum vertex extensions of the graph by the method of canonical representatives [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2021 A graph $G = (V, \alpha)$ is called \textit{primitive} if there exists a natural $k$ such that between any pair of vertices of the graph $G$ there is a route of length $k$. This paper considers undirected graphs with exponent 2.
Abrosimov, Mihail Borisovich +2 more
doaj +1 more source
On r-Edge Regular Neutrosophic Graphs [PDF]
Neutrosophic Sets and Systems, 2023 We approach learning characteristic on a neutrosophic graph such as r-edge regular neutrosophic graph, strongly edge regular neutrosophic graph and absolute degree of vertex since a neutrosophic set 𝑁𝑆 = {〈𝑥, 𝑁𝑆𝔗(𝑥), 𝑁𝑆𝔩 (𝑥), 𝑁𝑆𝔉(𝑥)〉; 𝑥 ∈ 𝑋} of a ...
M. Kaviyarasu
doaj +1 more source
On families of 2-nearly Platonic graphs
Electronic Journal of Graph Theory and Applications, 2022 A 2-nearly Platonic graph of type (k|d) is a k-regular planar graph with f faces, f − 2 of which are of size d and the remaining two are of sizes d1, d2, both different from d. Such a graph is called balanced if d1 = d2.
Dalibor Froncek +3 more
doaj +1 more source
On regular spherical fuzzy graph [PDF]
Journal of Hyperstructures, 2023 A spherical fuzzy set is an advanced extension of clas-sical fuzzy set in which it has an added advantage to deal with awider sense of applicability in uncertain situations. In this paper,regular spherical fuzzy graphs and totally regular spherical fuzzy
B. Mohamed Harif, NAZEERA BEGAM
doaj +1 more source
Antifactors of regular bipartite graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Let $G=(X,Y;E)$ be a bipartite graph, where $X$ and $Y$ are color classes and $E$ is the set of edges of $G$. Lov\'asz and Plummer \cite{LoPl86} asked whether one can decide in polynomial time that a given bipartite graph $G=(X,Y; E)$ admits a 1-anti ...
Hongliang Lu, Wei Wang, Juan Yan
doaj +1 more source
On Subtree Number Index of Generalized Book Graphs, Fan Graphs, and Wheel Graphs
Journal of Mathematics, 2021 With generating function and structural analysis, this paper presents the subtree generating functions and the subtree number index of generalized book graphs, generalized fan graphs, and generalized wheel graphs, respectively.
Daoqiang Sun +4 more
doaj +1 more source
Orientable -distance magic regular graphs
AKCE International Journal of Graphs and Combinatorics, 2021 Hefetz, Mütze, and Schwartz conjectured that every connected undirected graph admits an antimagic orientation (Hefetz et al., 2010). In this paper we support the analogous question for distance magic labeling. Let be an Abelian group of order .
Paweł Dyrlaga, Karolina Szopa
doaj +1 more source