Results 11 to 20 of about 57,468 (218)
AVD proper edge-coloring of some families of graphs
International Journal of Mathematics for Industry, 2021 Adjacent vertex-distinguishing proper edge-coloring is the minimum number of colors required for the proper edge-coloring of [Formula: see text] in which no two adjacent vertices are incident to edges colored with the same set of colors.
J. Naveen
doaj +1 more source
CYCLIC PROPERTIES OF TRIANGULAR GRID GRAPHS [PDF]
IFAC Proceedings Volumes, 2006 Abstract It is known that all 2-connected, linearly convex triangular grid graphs, with only one exception, are hamiltonian (Reay and Zamfirescu, 2000). In the paper, it is shown that this result holds for a wider class of connected, locally connected triangular grid graphs and, with more exceptions, even for some general class of graphs.
Yury Orlovich +2 more
openaire +1 more source
On Triangular Secure Domination Number
InPrime, 2020 Let T_m=(V(T_m), E(T_m)) be a triangular grid graph of m ϵ N level. The order of graph T_m is called a triangular number. A subset T of V(T_m) is a dominating set of T_m if for all u_V(T_m)\T, there exists vϵT such that uv ϵ E(T_m), that is, N[T]=V(T_m).
Emily L Casinillo +3 more
doaj +1 more source
Applying Infinite Petri Nets to the Cybersecurity of Intelligent Networks, Grids and Clouds
Applied Sciences, 2021 Correctness of networking protocols represents the principal requirement of cybersecurity. Correctness of protocols is established via the procedures of their verification. A classical communication system includes a pair of interacting systems.
Dmitry A. Zaitsev +2 more
doaj +1 more source
AKCE International Journal of Graphs and Combinatorics, 2021 We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set such that the derived edge labels are the first n m-bonacci numbers.
Kalpana Mahalingam +1 more
doaj +1 more source
Probabilistic Distributed Algorithm for Uniform Election in Triangular Grid Graphs [PDF]
International Journal of Advanced Computer Science and Applications, 2013 Probabilistic algorithms are designed to handle problems that do not admit deterministic effective solutions.In the case of the election problem, many algorithms are available and applicable under appropriate assumptions, for example: the uniform election in trees, k-trees and polyominoids.In this paper, first, we introduce a probabilistic algorithm ...
Elham Mehdi, Ismail Hind, Abdelaaziz El
openaire +1 more source
On the Number of Shortest Weighted Paths in a Triangular Grid
Mathematics, 2020 Counting the number of shortest paths in various graphs is an important and interesting combinatorial problem, especially in weighted graphs with various applications. We consider a specific infinite graph here, namely the honeycomb grid. Changing to its
Benedek Nagy, Bashar Khassawneh
doaj +1 more source
IEEE Access, 2021 Concerning the coordination of autonomous mobile robots, the main focus has been on the important class of Pattern Formation problems, where the robots are required to arrange themselves to form a given geometric shape.
Serafino Cicerone
doaj +1 more source
On the edge irregularity strength of grid graphs
AKCE International Journal of Graphs and Combinatorics, 2020 For a simple graph G, a vertex labeling is called a vertex -labeling. For any edge in , its weight . If all the edge weights are distinct, then is called an edge irregular -labeling of .
I. Tarawneh, R. Hasni, A. Ahmad
doaj +1 more source
Hamiltonian properties of triangular grid graphs
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Orlovich, Yu. L. +2 more
openaire +3 more sources