Results 21 to 30 of about 161 (144)
Nullspace Embeddings for Outerplanar Graphs [PDF]
, 2017 21 pages.
Lovász, L., Schrijver, A.
openaire +4 more sources
Large Induced Acyclic and Outerplanar Subgraphs of 2-Outerplanar Graph [PDF]
Graphs and Combinatorics, 2017 13 pages, 7 figures.
Glencora Borradaile +2 more
openaire +2 more sources
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 +3 more
doaj +1 more source
On k-edge-magic labelings of maximal outerplanar graphs
AKCE International Journal of Graphs and Combinatorics, 2015 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 +1 more source
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
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
On infinite outerplanar graphs [PDF]
Mathematica Bohemica, 1994 In this Note, we study infinite graphs with locally finite outerplane embeddings, given a characterization by forbidden ...
Boza Prieto, Luis +2 more
openaire +4 more sources
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 +1 more
openaire +3 more sources
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
The Degree-Diameter Problem for Outerplanar Graphs
Discussiones Mathematicae Graph Theory, 2017 For positive integers Δ and D we define nΔ,D to be the largest number of vertices in an outerplanar graph of given maximum degree Δ and diameter D. We prove that nΔ,D=ΔD2+O (ΔD2−1)$n_{\Delta ,D} = \Delta ^{{D \over 2}} + O\left( {\Delta ^{{D \over 2 ...
Dankelmann Peter +2 more
doaj +1 more source