Results 21 to 30 of about 18,773 (121)
Infinite Hamiltonian paths in Cayley digraphs [PDF]
Let Cay(S:H) be the Cayley digraph of the generators S in the group H. A one-way infinite Hamiltonian path in the digraph G is a listing of all the vertices \([v_ i: 1\leq ...
Jungreis, Irwin L
openaire +4 more sources
Asymptotic enumeration of graphical regular representations
Abstract We estimate the number of graphical regular representations (GRRs) of a given group with large enough order. As a consequence, we show that almost all finite Cayley graphs have full automorphism groups ‘as small as possible’. This confirms a conjecture of Babai–Godsil–Imrich–Lovász on the proportion of GRRs, as well as a conjecture of Xu on ...
Binzhou Xia, Shasha Zheng
wiley +1 more source
Minimal‐time complex consensus for multi‐agent systems with time delay
Abstract This paper studies the minimum time consensus problem for discrete‐time multi‐agent systems with complex Laplacian delay networks such that each agent can find its complex consensus value in a minimum number of steps using its local observations.
Chao Zou, Li Yu, Simon Yang, Linlin Ou
wiley +1 more source
Certain Concepts in Vague Graph with an Application
Vague graphs (VGs), belonging to the FGs family, have good capabilities when faced with problems that cannot be expressed by FGs. When an element’s membership is not clear, neutrality is a good option that can be well‐supported by a VG. The previous definition limitations in irregular‐FG have led us to offer new definitions in VGs.
Xiaolong Shi +4 more
wiley +1 more source
Mobius Group Generated by Two Elements of Order 2, 4, and Reduced Quadratic Irrational Numbers
The construction of circuits for the evolution of orbits and reduced quadratic irrational numbers under the action of Mobius groups have many applications like in construction of substitution box (s‐box), strong‐substitution box (s.s‐box), image processing, data encryption, in interest for security experts, and other fields of sciences.
Dilshad Alghazzawi +5 more
wiley +1 more source
[Retracted] Novel Concepts in Bipolar Fuzzy Graphs with Applications
Many problems of practical interest can be modeled and solved by using bipolar graph algorithms. Bipolar fuzzy graph (BFG), belonging to fuzzy graphs (FGs) family, has good capabilities when facing with problems that cannot be expressed by FGs. Hence, in this paper, we introduce the notion of (ϑ, δ)−homomorphism of BFGs and classify homomorphisms (HMs),
Chang Wan +6 more
wiley +1 more source
Studies of Chordal Ring Networks via Double Metric Dimensions
Locating the sources of information spreading in networks including tracking down the origins of epidemics, rumors in social networks, and online computer viruses, has a wide range of applications. In many situations, identifying where an epidemic started, or which node in a network served as the source, is crucial. But it can be difficult to determine
M. Ahmad +4 more
wiley +1 more source
A Study on Interval‐Valued Fuzzy Graph with Application in Energy Industry Management
In this paper, we define the concept of level graphs on interval‐valued fuzzy graphs (IVFGs) and introduce the notions of [α, β]−[α, β]− homomorphism, isomorphism, weak isomorphism, and co‐weak isomorphism of IVFGs by [α, β]− homomorphism. Also, an application of homomorphism of IVFGs has been presented by using coloring‐FG.
Xiaoli Qiang +6 more
wiley +1 more source
Novel Concepts in Vague Graphs with Application in Hospital’s Management System
Many problems of practical interest can be modeled and solved by using vague graph (VG) algorithms. Vague graphs, belonging to the fuzzy graphs (FGs) family, have good capabilities when faced with problems that cannot be expressed by FGs. Hence, in this paper, we introduce the notion of (η, γ)‐ HMs of VGs and classify homomorphisms (HMs), weak ...
Xiaolong Shi +5 more
wiley +1 more source
Graph labeling, introduced by \textit{A. Rosa} in [``On certain valuations of the vertices of a graph,'' Theory Graphs, Int. Symp. Rome 1966, 349--355 (1967; Zbl 0193.53204)], deals with assigning integers to the vertices or edges or both satisfying some combinatorial constraint. Labeled graphs serve as useful models for numerous applications such as a
K. Thirusangu +2 more
openaire +3 more sources

