Results 31 to 40 of about 174 (114)
The non-commuting graph of a non-central hypergroup
Open Mathematics, 2019 The aim of this paper is to construct and study the properties of a certain graph associated with a non-central hypergroup, i.e. a hypergroup having non-commutative the associated fundamental group.
Iranmanesh Mahdiyeh +2 more
doaj +1 more source
Open Mathematics, 2020 A Cayley graph Γ\Gamma on a group G is called a dual Cayley graph on G if the left regular representation of G is a subgroup of the automorphism group of Γ\Gamma (note that the right regular representation of G is always an automorphism group of Γ ...
Pan Jiangmin
doaj +1 more source
Path homology theory of edge-colored graphs
Open Mathematics, 2021 In this paper, we introduce the category and the homotopy category of edge-colored digraphs and construct the functorial homology theory on the foundation of the path homology theory provided by Grigoryan, Muranov, and Shing-Tung Yau.
Muranov Yuri V., Szczepkowska Anna
doaj +1 more source
, 2013 In this paper we define a new monoid construction under crossed products for given monoids. We also present a generating set and a relator set for this product. Finally, we give the necessary and sufficient conditions for the regularity of it. MSC: 05C10,
Cangül, İ. N. +3 more
core +1 more source
Finite groups whose intersection power graphs are toroidal and projective-planar
Open Mathematics, 2021 The intersection power graph of a finite group GG is the graph whose vertex set is GG, and two distinct vertices xx and yy are adjacent if either one of xx and yy is the identity element of GG, or ⟨x⟩∩⟨y⟩\langle x\rangle \cap \langle y\rangle is non ...
Li Huani, Ma Xuanlong, Fu Ruiqin
doaj +1 more source
, 2013 Classification AMS : 05 - Combinatorics for finite fields/05C - Graphs theory for applications of graphs/05C25 - Graphs and groups 05 - Combinatorics for finite fields/05C - Graphs theory for applications of graphs/05C69 - Dominating sets, independent ...
Lantner, Roland, Lebert, Didier
core +3 more sources
Distinguishing Cartesian Products of Countable Graphs
Discussiones Mathematicae Graph Theory, 2017 The distinguishing number D(G) of a graph G is the minimum number of colors needed to color the vertices of G such that the coloring is preserved only by the trivial automorphism.
Estaji Ehsan +4 more
doaj +1 more source
Open MathematicsLet SS be a semigroup. In this study, we first introduce the Green’s digraphs and Green’s graphs related to the Green’s relations L{\mathscr{L}}, R{\mathscr{R}}, and J{\mathscr{J}} of SS.
Cheng Yanliang, Shao Yong, Ma Xuanlong
doaj +1 more source
Journal of Applied Mathematics, Volume 2026, Issue 1, 2026.Among the diverse types of graph products, the double join and double corona operations have remained central to many recent developments in graph theory, offering fresh insights and problem‐solving strategies. Subdivision graphs, in particular, serve as an essential tool for examining how structural modifications along edges influence the overall ...
M. Vimal +3 more
wiley +1 more source
The Binding Number of a Zero Divisor Graph [PDF]
, 2013 In this paper, we evaluate b(Γ(Z n )). Our main result is, we give maximum value of b(Γ(Z n )) is 0.99999999796427626489236243072661, where n is any positive integer upto fiftieth million.
J Ravi Sankar +3 more
core