Results 71 to 80 of about 16,950 (147)
On dominating sets of maximal outerplanar graphs
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Campos, C.N., Wakabayashi, Y.
openaire +1 more source
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs [PDF]
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices,
Laskar, R.C., Mulder, H.M., Novick, B.
core +1 more source
Storage Capacity as an Information-Theoretic Vertex Cover and the Index Coding Rate
, 2017 Motivated by applications in distributed storage, the storage capacity of a graph was recently defined to be the maximum amount of information that can be stored across the vertices of a graph such that the information at any vertex can be recovered from
Mazumdar, Arya +2 more
core +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 +2 more
core +1 more source
A node-capacitated Okamura-Seymour theorem
, 2012 The classical Okamura-Seymour theorem states that for an edge-capacitated, multi-commodity flow instance in which all terminals lie on a single face of a planar graph, there exists a feasible concurrent flow if and only if the cut conditions are ...
Lee, James R. +2 more
core +1 more source
Centroidal localization game [PDF]
, 2018 One important problem in a network is to locate an (invisible) moving entity by using distance-detectors placed at strategical locations. For instance, the metric dimension of a graph $G$ is the minimum number $k$ of detectors placed in some vertices ...
Bosek, Bartłomiej +5 more
core +2 more sources
Location in maximal outerplanar graphs
, 2017 In this work we study the metric dimension and the location-domination number of maximal outerplanar graphs. Concretely, we determine tight upper and lower bounds on the metric dimension and characterize those maximal outerplanar graphs attaining the lower bound. We also give a lower bound on the location-domination number
Claverol Aguas, Mercè +6 more
openaire +1 more source
Dominating sets of maximal outerplanar graphs
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Algorithm on rainbow connection for maximal outerplanar graphs
Theoretical Computer Science, 2016 In this paper, we consider rainbow connection number of maximal outerplanar graphs(MOPs) on algorithmic aspect. For the (MOP) $G$, we give sufficient conditions to guarantee that $rc(G) = diam(G).$ Moreover, we produce the graph with given diameter $d$ and give their rainbow coloring in linear time. X.Deng et al.
Deng, Xingchao +2 more
openaire +2 more sources
Edge Roman domination on graphs
, 2014 An edge Roman dominating function of a graph $G$ is a function $f\colon E(G) \rightarrow \{0,1,2\}$ satisfying the condition that every edge $e$ with $f(e)=0$ is adjacent to some edge $e'$ with $f(e')=2$.
Chang, Gerard J. +2 more
core