Results 11 to 20 of about 86,214 (301)
Hexagonal systems with forcing edges
Discrete Mathematics, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fuji Zhang, Xueliang Li 0001
openaire +2 more sources
Hexagonal systems with fixed bonds
Discrete Applied Mathematics, 1993 Skeletons of benzenoid hydrocarbon molecules are presented by hexagonal systems \(H\), i.e. 2-connected subgraphs of the hexagonal grid graph. An edge of \(H\) is called a fixed bond if it is contained in all or in no perfect matching of \(H\). An \(O(n^ 2)\) algorithm to determine fixed bonds in a hexagonal system is given.
Fuji Zhang +2 more
openaire +2 more sources
Tissue-like P system for Segmentation of 2D Hexagonal Images
ARO-The Scientific Journal of Koya University, 2016 Membrane computing, which is a new computational model inspired by the structure and functioning of biological cells and by the way the cells are organized in tissues. MC has been adopted in many real world applications including image segmentation.
Rafaa I. Yahya +3 more
doaj +3 more sources
Generalized hexagonal systems with each hexagon being resonant
Discrete Applied Mathematics, 1992 A hexagonal system (HS) is a finite 2-connected planar graph in which each interior face is a regular hexagon of side length 1, and a generalized hexagonal system (GHS) is a graph obtained by deleting some interior vertices and interior edges from a HS.
Fuji Zhang, Maolin Zheng
openaire +3 more sources
The Clar covering polynomial of hexagonal systems I
Discrete Applied Mathematics, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heping Zhang, Fuji Zhang
core +4 more sources
Hypergraphs and the Clar problem in hexagonal systems
Discrete Optimization, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Khaled Salem, Hernán G. Abeledo
openaire +3 more sources
IEEE AccessIn the domains of image processing and computer vision, the exploration of hexagonal image processing systems has emerged as a fundamentally innovative yet nascent methodology that is motivated by the occurrence of hexagonal structures in the human ...
Tobias Schlosser +4 more
doaj +2 more sources
Hexagonal coordinate systems and steiner minimal trees
Discrete Mathematics, 1986 A Steiner minimal tree for n points in the plane is a tree of minimal length whose vertices include the original n points. Added vertices (other than the original n points) are called Steiner points. It is well- known that Steiner points are degree-3 vertices with each pair of edges meeting at a \(120^ o\) angle.
Frank K. Hwang, J. F. Weng
openaire +2 more sources
Hexagonal systems with forcing single edges
Discrete Applied Mathematics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Xueliang
openaire +2 more sources
Research and Design of Hexagonal Gaming System
, 2022 In recent years, Hexagonal chess has gradually appeared in various machine gaming competitions, and is popular among the public because of its simple and fair game rules.
LI Yongyuan, WEI Yiyang, LI Yuqi
core +1 more source