Results 1 to 10 of about 4,621 (198)
Outerplanar graph drawings with few slopes [PDF]
We consider straight-line outerplanar drawings of outerplanar graphs in which a small number of distinct edge slopes are used, that is, the segments representing edges are parallel to a small number of directions.
Bartosz Walczak +16 more
core +9 more sources
Strong Chromatic Index of Outerplanar Graphs [PDF]
The strong chromatic index χs′(G) of a graph G is the minimum number of colors needed in a proper edge-coloring so that every color class induces a matching in G. It was proved In 2013, that every outerplanar graph G with Δ≥3 has χs′(G)≤3Δ−3.
Ying Wang +3 more
doaj +2 more sources
Bipolar fuzzy outerplanar graphs approach in image shrinking [PDF]
Bipolar fuzzy outerplanar graphs are interesting and significant subclasses within the broader field of fuzzy graph theory. In this paper, bipolar fuzzy outerplanar graphs, and its properties are introduced.
Deivanai Jaisankar +3 more
doaj +2 more sources
On k-edge-magic labelings of maximal outerplanar graphs [PDF]
Let G be a graph with vertex set V and edge set E such that |V|=p and |E|=q. We denote this graph by (p,q)-graph. For integers k≥0, define a one-to-one map f from E to {k,k+1,…,k+q−1} and define the vertex sum for a vertex v as the sum of the labels of ...
Gee-Choon Lau +3 more
doaj +2 more sources
A fuzzy graph theoretic approach to face shape recognition using cubic outerplanar structures [PDF]
The well-known topic of crisp graph planarity is contrasted with the more new and thoroughly studied field of planarity inside a fuzzy framework. In cubic fuzzy domain, cubic multisets with interval and fuzzy number to capture vagueness.
Deivanai Jaisankar +2 more
doaj +2 more sources
Network design for bypass roads using interval valued fuzzy outerplanar graphs [PDF]
This paper presents a novel approach to bypass road network design using interval valued fuzzy outerplanar graphs (IVFOGs), addressing the increasing demands of vehicular growth and evolving lifestyles.
Deivanai Jaisankar +3 more
doaj +2 more sources
Frequent Subgraph Mining in Outerplanar Graphs [PDF]
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 +2 more
core +4 more sources
Characterization of outerplanar graphs with equal 2-domination and domination numbers
A {\em $k$-domination number} of a graph $G$ is minimum cardinality of a $k$-dominating set of $G$, where a subset $S \subseteq V(G)$ is a {\em $k$-dominating set} if each vertex $v\in V(G)\setminus S$ is adjacent to at least $k$ vertices in $S$.
Naoki Matsumoto
doaj +3 more sources
On the k-restricted structure ratio in planar and outerplanar graphs [PDF]
Graphs and ...
Gruia Călinescu, Cristina G. Fernandes
doaj +2 more sources
The Planar Index and Outerplanar Index of Some Graphs Associated to Commutative Rings
In this paper, we study the planar and outerplanar indices of some graphs associated to a commutative ring. We give a full characterization of these graphs with respect to their planar and outerplanar indices when R is a finite ring.
Barati Zahra, Afkhami Mojgan
doaj +2 more sources

