Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[КНИГА][B] Graphs from rings
In this book, we introduce several graphical representations of a ring. In the past three
decades, graphs constructed from algebraic structures have been studied extensively by …
decades, graphs constructed from algebraic structures have been studied extensively by …
Power graphs: a survey
Power Graphs: A Survey Page 1 www.ejgta.org Electronic Journal of Graph Theory and
Applications 1 (2) (2013), 125–147 Power Graphs: A Survey Jemal Abawajya, Andrei …
Applications 1 (2) (2013), 125–147 Power Graphs: A Survey Jemal Abawajya, Andrei …
[HTML][HTML] Cayley graphs as classifiers for data mining: The influence of asymmetries
The endomorphism monoids of graphs have been actively investigated. They are
convenient tools expressing asymmetries of the graphs. One of the most important classes of …
convenient tools expressing asymmetries of the graphs. One of the most important classes of …
[PDF][PDF] Labelled Cayley graphs and minimal automata
A Kelarev - 2004 - figshare.utas.edu.au
Cayley graphs considered as language recognisers are as powerful as the more general
finite state automata. This paper applies Cayley graphs to define a class of automata and …
finite state automata. This paper applies Cayley graphs to define a class of automata and …
Development of a new minimum avoidance system for a behavior-based mobile robot
A new fuzzy logic algorithm is developed for mobile robot navigation in local environments.
A Pioneer robot perceives its environment through an array of eight sonar sensors and self …
A Pioneer robot perceives its environment through an array of eight sonar sensors and self …
Certain properties of the power graph associated with a finite group
The power graph of a group G is a simple graph whose vertex-set is G and two vertices x
and y in G are adjacent if and only if one of them is a power of the other. The subgraph of is …
and y in G are adjacent if and only if one of them is a power of the other. The subgraph of is …
On enhanced power graphs of finite groups
Given a group G, the enhanced power graph of G, denoted by 𝒢 e (G), is the graph with
vertex set G and two distinct vertices x and y are edge connected in 𝒢 e (G) if there exists z∈ …
vertex set G and two distinct vertices x and y are edge connected in 𝒢 e (G) if there exists z∈ …
[HTML][HTML] The structure and metric dimension of the power graph of a finite group
M Feng, X Ma, K Wang - European Journal of Combinatorics, 2015 - Elsevier
The power graph PG of a finite group G is the graph with the vertex set G, where two distinct
vertices are adjacent if one is a power of the other. We first show that PG has a transitive …
vertices are adjacent if one is a power of the other. We first show that PG has a transitive …
A combinatorial property and power graphs of semigroups
Research on combinatorial properties of sequences in groups and semigroups originates
from Bernhard Neumann's theorem answering a question of Paul Erd"{o} s. For results on …
from Bernhard Neumann's theorem answering a question of Paul Erd"{o} s. For results on …
A study of enhanced power graphs of finite groups
The enhanced power graph 𝒢 e (G) of a group G is the graph with vertex set G such that two
vertices x and y are adjacent if they are contained in the same cyclic subgroup. We prove …
vertices x and y are adjacent if they are contained in the same cyclic subgroup. We prove …