Results 1 to 10 of about 3,610 (117)

Bipolar fuzzy outerplanar graphs approach in image shrinking [PDF]

Scientific Reports
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, Sujatha Ramalingam, Nagarajan Deivanayagampillai, Tadesse Walelign   +3 more
doaj   +2 more sources

A fuzzy graph theoretic approach to face shape recognition using cubic outerplanar structures [PDF]

Scientific Reports
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, Sujatha Ramalingam, Gizachew Bayou Zegeye   +2 more
doaj   +2 more sources

Network design for bypass roads using interval valued fuzzy outerplanar graphs [PDF]

Scientific Reports
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, Sujatha Ramalingam, Nagarajan Deivanayagampillai, Tadesse Walelign   +3 more
doaj   +2 more sources

Edge-group choosability of outerplanar and near-outerplanar graphs [PDF]

Transactions on Combinatorics, 2020
Let $\chi_{gl}(G)$ be the {\it{group choice number}} of $G$. A graph $G$ is called {\it{edge-$k$-group choosable}} if its line graph is $k$-group choosable. The {\it{group-choice index}} of $G$, $\chi'_{gl}(G)$, is the smallest $k$ such that $G$ is edge-$
Amir Khamseh
doaj   +1 more source

Circular Separation Dimension of a Subclass of Planar Graphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2017
A pair of non-adjacent edges is said to be separated in a circular ordering of vertices, if the endpoints of the two edges do not alternate in the ordering.
Arpitha P. Bharathi, Minati De, Abhiruk Lahiri   +2 more
doaj   +1 more source

On the number of series parallel and outerplanar graphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2005
We show that the number $g_n$ of labelled series-parallel graphs on $n$ vertices is asymptotically $g_n \sim g \cdot n^{-5/2} \gamma^n n!$, where $\gamma$ and $g$ are explicit computable constants.
Manuel Bodirsky, Omer Gimenez, Mihyun Kang, Marc Noy   +3 more
doaj   +1 more source

Strong Chromatic Index of Outerplanar Graphs

Axioms, 2022
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, Yiqiao Wang, Weifan Wang, Shuyu Cui   +3 more
doaj   +1 more source

Optimal maximal graphs [PDF]

Transactions on Combinatorics, 2022
An optimal labeling of a graph with $n$ vertices and $m$ edges is an injective assignment of the first $n$ nonnegative integers to the vertices‎, ‎that induces‎, ‎for each edge‎, ‎a weight given by the sum of the labels of its end-vertices with the ...
Christian Barrientos, Maged Youssef
doaj   +1 more source

Clique-Relaxed Graph Coloring [PDF]

, 2011
We define a generalization of the chromatic number of a graph G called the k-clique-relaxed chromatic number, denoted χ(k)(G). We prove bounds on χ(k)(G) for all graphs G, including corollaries for outerplanar and planar graphs.
Dunn, Charles, Naymie, Cassandra, Nordstrom, Jennifer Firkins, Pitney, Erin, Sehorn, William, Suer, Charlie   +5 more
core   +2 more sources

Alpha Labeling of Amalgamated Cycles

Theory and Applications of Graphs, 2022
A graceful labeling of a bipartite graph is an \a-labeling if it has the property that the labels assigned to the vertices of one stable set of the graph are smaller than the labels assigned to the vertices of the other stable set.
Christian Barrientos
doaj   +1 more source