Results 1 to 10 of about 9,039,686 (137)

‎Fuzzy Subgroups and Digraphs Induced by Fuzzy Subgroups [PDF]

open access: yesTransactions on Fuzzy Sets and Systems, 2022
Given a fuzzy subgroup $\mu$ of a group $G$‎, ‎$x\rhd_uy$ if and only if $\mu(xy) < \mu(yx)$ defines a directed relation with an associated digraph $(G‎, ‎\rhd_u)$‎.
Paul J. Allen   +2 more
doaj   +1 more source

Action graph of a semigroup act & its functorial connection [PDF]

open access: yesCategories and General Algebraic Structures with Applications, 2023
In this paper we define C-induced action graph G(S,a,C;A) corresponding to a semigroup act (S,a,A) and a subset C of S. This generalizes many interesting graphs including Cayley Graph of groups and semigroups, Transformation Graphs (TRAG), Group Action ...
Promit Mukherjee   +2 more
doaj   +1 more source

On Haar digraphical representations of groups [PDF]

open access: yesDiscrete Mathematics, 2020
8 ...
Du J. -L., Feng Y. -Q., Spiga P.
openaire   +3 more sources

Hyper-Hamiltonian circulants

open access: yesElectronic Journal of Graph Theory and Applications, 2021
A Hamiltonian graph G = (V,E) is called hyper-Hamiltonian if G-v is Hamiltonian for any v ∈ V(G). G is called a circulant if its automorphism group contains a |V(G)|-cycle.
Zbigniew R. Bogdanowicz
doaj   +1 more source

Ordered-Bipartite Consensus of Multi-Agent Systems under Finite Time Control

open access: yesApplied Sciences, 2022
Since group consensus (GC) control accounts for one-half of the multi-robot coordination domain, as does complete consensus control, this paper will formulate a certain kind of GC and group bipartite consensus (GBC) in finite time for multi-agent systems
Tiehui Zhang   +5 more
doaj   +1 more source

On n-partite digraphical representations of finite groups [PDF]

open access: yesJournal of Combinatorial Theory, Series A, 2022
9 ...
Du J. -L., Feng Y. -Q., Spiga P.
openaire   +2 more sources

Automorphism Groups of Wreath Product Digraphs [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2009
We generalize a classical result of Sabidussi that was improved by Hemminger, to the case of directed color graphs. The original results give a necessary and sufficient condition on two graphs, $C$ and $D$, for the automorphsim group of the wreath product of the graphs, ${\rm Aut}(C\wr D)$ to be the wreath product of the automorphism groups ${\rm Aut}(
Dobson, Edward, Morris, Joy
openaire   +4 more sources

Realization of digraphs in Abelian groups and its consequences [PDF]

open access: yesJournal of Graph Theory, 2021
AbstractLet be a directed graph of order with no component of order less than 3, and let be a finite Abelian group such that or if is large enough with respect to an arbitrarily fixed then . We show that there exists an injective mapping from to the group such that for every connected component of , where 0 is the identity element of ...
Sylwia Cichacz, Zsolt Tuza
openaire   +3 more sources

Modeling of Barriers to the Adoption of Autonomous Vehicles: DEMATEL Method

open access: yesEngineering Proceedings, 2023
Autonomous vehicles (AVs) have the potential to increase safety while reducing energy use, pollution, and traffic congestion, to name a few positive effects. Industries, however, are having trouble implementing AVs. The goal of this study was to pinpoint
Karan Ashok Jalwani   +1 more
doaj   +1 more source

Graph Theory Approach to COVID-19 Transmission by Municipalities and Age Groups

open access: yesMathematical and Computational Applications, 2022
The COVID-19 pandemic remains a global problem that affects the health of millions of people and the world economy. Identifying how the movement of people between regions of the world, countries, and municipalities and how the close contact between ...
Pedro Machado   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy