Results 91 to 100 of about 1,769 (162)
Generalized outerplanar index of a graph [PDF]
, 2018 summary:We define the generalized outerplanar index of a graph and give a full characterization of graphs with respect to this ...
Barati, Zahra
core +1 more source
A linear algorithm to recognize maximal generalized outerplanar graphs [PDF]
, 1997 summary:In this work, we get a combinatorial characterization for maximal generalized outerplanar graphs (mgo graphs).
Márquez Pérez, Alberto +2 more
core +1 more source
Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs
Journal of Graph Algorithms and Applications, 2013 A graph G = (V,E) is called a pairwise compatibility graph (PCG) if there exists an edge-weighted tree T and two non-negative real numbers dmin and dmax such that each vertex u′ ∈ V corresponds to a leaf u of T and there is an edge (u′, v′) ∈ E if and
Sammi Abida Salma +2 more
doaj +1 more source
A graph and its complement with specified properties I: connectivity
International Journal of Mathematics and Mathematical Sciences, 1979 We investigate the conditions under which both a graph G and its complement G¯ possess a specified property. In particular, we characterize all graphs G for which G and G¯ both (a) have connectivity one, (b) have line-connectivity one, (c) are 2 ...
Jin Akiyama, Frank Harary
doaj +1 more source
A fuzzy graph theoretic approach to face shape recognition using cubic outerplanar structures
Scientific ReportsThe 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 +1 more source
Indonesian Journal of CombinatoricsA planar graph is said to be zonal when is possible to label its vertices with the nonzero elements of ℤ3, in such a way that the sum of the labels of the vertices on the boundary of each zone is 0 in ℤ3.
Christian Barrientos, Sarah Minion
doaj +1 more source
Star Coloring Outerplanar Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2019 A proper coloring of the vertices of a graph is called a star coloring if at least three colors are used on every 4-vertex path. We show that all outerplanar bipartite graphs can be star colored using only five colors and construct the smallest known ...
Ramamurthi Radhika, Sanders Gina
doaj +1 more source
On the Planarity of Generalized Line Graphs
Theory and Applications of Graphs, 2019 One of the most familiar derived graphs is the line graph. The line graph $L(G)$ of a graph $G$ is that graph whose vertices are the edges of $G$ where two vertices of $L(G)$ are adjacent if the corresponding edges are adjacent in~$G$.
Khawlah H. Alhulwah +2 more
doaj +1 more source
Subgraph Homeomorphism via the Edge Addition Planarity Algorithm
Journal of Graph Algorithms and Applications, 2012 This paper extends the edge addition planarity algorithm from Boyer and Myrvold to provide a new way of solving the subgraph homeomorphism problem for K2,3, K4, and K3,3.
John Boyer
doaj +1 more source