Results 11 to 20 of about 40,667 (118)
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 +5 more sources
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
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
Mathematics, 2022 Flow of a liquid in an enclosure with heat transfer has drawn special focus of researchers due to the abundant thermal engineering applications. So, the aim of present communication is to explore thermal characteristics of natural convective power-law ...
Sardar Bilal +5 more
doaj +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
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
3/2 Firefighters are not enough [PDF]
, 2010 The firefighter problem is a monotone dynamic process in graphs that can be viewed as modeling the use of a limited supply of vaccinations to stop the spread of an epidemic.
Berlekamp +16 more
core +1 more source
The looping rate and sandpile density of planar graphs [PDF]
, 2015 We give a simple formula for the looping rate of loop-erased random walk on a finite planar graph. The looping rate is closely related to the expected amount of sand in a recurrent sandpile on the graph.
Kassel, Adrien, Wilson, David B.
core +1 more source
Small grid embeddings of 3-polytopes [PDF]
, 2009 We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by $O(2^{7.55n})=O(188^{n})$.
A. Ribó Mor +35 more
core +3 more sources
The Complexity of Simultaneous Geometric Graph Embedding [PDF]
, 2015 Given a collection of planar graphs $G_1,\dots,G_k$ on the same set $V$ of $n$ vertices, the simultaneous geometric embedding (with mapping) problem, or simply $k$-SGE, is to find a set $P$ of $n$ points in the plane and a bijection $\phi: V \to P$ such ...
Cardinal, Jean, Kusters, Vincent
core +1 more source