Results 51 to 60 of about 3,901 (159)

Fuzzy Outerplanar Graphs and Its Applications

International Journal of Computational Intelligence Systems
The concept of a crisp graph is essential in the study of outerplanar graphs because outerplanar graphs are a unique type of planar graphs containing special characteristics. One of the core concepts of crisp graphs, the notion of a subgraph, is utilized
Deivanai Jaisankar, Sujatha Ramalingam, Nagarajan Deivanayagampillai, Tadesse Walelign   +3 more
doaj   +1 more source

L(2, 1)-Labelings of Some Families of Oriented Planar Graphs

Discussiones Mathematicae Graph Theory, 2014
In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.
Sen Sagnik
doaj   +1 more source

Pixel and Voxel Representations of Graphs

, 2015
We study contact representations for graphs, which we call pixel representations in 2D and voxel representations in 3D. Our representations are based on the unit square grid whose cells we call pixels in 2D and voxels in 3D.
A Bezdek, AL Buchsbaum, C Thomassen, C Zong, CA Duncan, D Bremner, D Dolev, FJ Brandenburg, FJ Brandenburg, FV Fomin, G Battista Di, H Fraysseix de, H Fraysseix de, H Fraysseix de, HL Bodlaender, J Pach, J-H Fan, K Bezdek, M Patrignani, MJ Alam, N Aerts, P Bose, P Hliněný, P Koebe, R Cano, R Tamassia, S Chaplick, SN Bhatt, T Biedl, TC Biedl, TM Chan, W Evans   +31 more
core   +1 more source

Monitoring maximal outerplanar graphs [PDF]

Electronic Notes in Discrete Mathematics, 2014
In this paper we define a new concept of monitoring the elements of triangulation graphs by faces. Furthermore, we analyze this, and other monitoring concepts (by vertices and by edges), from a combinatorial point of view, on maximal outerplanar graphs.
Hernández Peñalver, Gregorio, Martins, Ana Mafalda   +1 more
openaire   +3 more sources

Recognizing Trees From Incomplete Decks

Journal of Graph Theory, Volume 110, Issue 3, Page 322-336, November 2025.
ABSTRACT Given a graph G, the unlabeled subgraphs G − v are called the cards of G. The deck of G is the multiset { G − v : v ∈ V ( G ) }. Wendy Myrvold showed that a disconnected graph and a connected graph both on n vertices have at most ⌊ n 2 ⌋ + 1 cards in common and found (infinite) families of trees and disconnected forests for which this upper ...
Gabriëlle Zwaneveld
wiley   +1 more source

Frequent Subgraph Mining in Outerplanar Graphs [PDF]

, 2010
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining problem for tree datasets can be solved in incremental polynomial time, it ...
Horvath, Tamas, Ramon, Jan, Wrobel, Stefan   +2 more
core   +1 more source

On Endomorphism Universality of Sparse Graph Classes

Journal of Graph Theory, Volume 110, Issue 2, Page 223-244, October 2025.
ABSTRACT We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best‐possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by‐product,
Kolja Knauer, Gil Puig i Surroca
wiley   +1 more source

A Universal Point Set for 2-Outerplanar Graphs

, 2015
A point set $S \subseteq \mathbb{R}^2$ is universal for a class $\cal G$ if every graph of ${\cal G}$ has a planar straight-line embedding on $S$. It is well-known that the integer grid is a quadratic-size universal point set for planar graphs, while the
C Binucci, H Fraysseix, M Kurowski, MJ Bannister, P Angelini, P Bose, P Gritzmann, R Fulek, S Cabello   +8 more
core   +1 more source

Tight Distance Query Reconstruction for Trees and Graphs Without Long Induced Cycles

Random Structures &Algorithms, Volume 66, Issue 4, July 2025.
ABSTRACT Given access to the vertex set V$$ V $$ of a connected graph G=(V,E)$$ G=\left(V,E\right) $$ and an oracle that given two vertices u,v∈V$$ u,v\in V $$, returns the shortest path distance between u$$ u $$ and v$$ v $$, how many queries are needed to reconstruct E$$ E $$?
Paul Bastide, Carla Groenland
wiley   +1 more source

Feedback Arc Number and Feedback Vertex Number of Cartesian Product of Directed Cycles

Discrete Dynamics in Nature and Society, Volume 2019, Issue 1, 2019., 2019
For a digraph D, the feedback vertex number τ(D), (resp. the feedback arc number τ′(D)) is the minimum number of vertices, (resp. arcs) whose removal leaves the resultant digraph free of directed cycles. In this note, we determine τ(D) and τ′(D) for the Cartesian product of directed cycles D=Cn1→□Cn2→□…Cnk→. Actually, it is shown that τ′D=n1n2…nk∑i=1k1/
Xiaohong Chen, Baoyindureng Wu, Seenith Sivasundaram   +2 more
wiley   +1 more source