Results 51 to 60 of about 850,474 (224)
Algorithms, 2013 The maximum common connected edge subgraph problem is to find a connected graph with the maximum number of edges that is isomorphic to a subgraph of each of the two input graphs, where it has applications in pattern recognition and chemistry.
Takeyuki Tamura, Tatsuya Akutsu
doaj +1 more source
Characterization of outerplanar graphs with equal 2-domination and domination numbers
Theory and Applications of Graphs, 2022 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 +1 more source
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs [PDF]
, 2008 We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolation lemma as described in (Mulmuley et al.
Datta, Samir +2 more
core +7 more sources
On an interpolation property of outerplanar graphs
Discrete Applied Mathematics, 2006 Let \(D\) be an acyclic orientation of a graph \(G\). An arc of \(D\) is dependent if a directed cycle is created when it is reversed. Denote by \(d(D)\) the number of dependent arcs in \(D\). Let \(d_{\min}(G)\) be the minimum \(d(D)\), and \(d_{\max}(G)\) the maximum \(d(D)\), over all acyclic orientations \(D\) of \(G\).
Li-Da Tong, Ko-Wei Lih, Chen-Ying Lin
openaire +2 more sources
Game Chromatic Number of Generalized Petersen Graphs and Jahangir Graphs
Journal of Applied Mathematics, Volume 2020, Issue 1, 2020., 2020 Let G = (V, E) be a graph, and two players Alice and Bob alternate turns coloring the vertices of the graph G a proper coloring where no two adjacent vertices are signed with the same color. Alice′s goal is to color the set of vertices using the minimum number of colors, which is called game chromatic number and is denoted by χg(G), while Bob′s goal is
Ramy Shaheen +3 more
wiley +1 more source
Scaling Limits of Random Graphs from Subcritical Classes: Extended abstract [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 We study the uniform random graph $\mathsf{C}_n$ with $n$ vertices drawn from a subcritical class of connected graphs. Our main result is that the rescaled graph $\mathsf{C}_n / \sqrt{n}$ converges to the Brownian Continuum Random Tree $\mathcal{T}_ ...
Konstantinos Panagiotou +2 more
doaj +1 more source
Vietnam Journal of Computer Science, 2018 We propose aggregative context-aware fitness functions based on feature selection for evolutionary learning of characteristic graph patterns. The proposed fitness functions estimate the fitness of a set of correlated individuals rather than the sum of ...
Fumiya Tokuhara +4 more
doaj +1 more source
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles [PDF]
, 2019 Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings via alternating cycles. Namely, we want to find a shortest sequence of perfect matchings which transforms one given perfect matching ...
Ito, Takehiro +4 more
core +2 more sources
The reconstruction of outerplanar graphs
Journal of Combinatorial Theory, Series B, 1974 AbstractUlam's conjecture is that a graph G with at least three vertices can be reconstructed from the family of subgraphs of G obtained by deleting single vertices of G. This paper proves the conjecture for G outerplanar, by working first with partially labeled graphs and then applying the results obtained to the unlabeled case.
openaire +4 more sources
A Note on the Fair Domination Number in Outerplanar Graphs
Discussiones Mathematicae Graph Theory, 2020 For k ≥ 1, a k-fair dominating set (or just kFD-set), in a graph G is a dominating set S such that |N(v) ∩ S| = k for every vertex v ∈ V − S. The k-fair domination number of G, denoted by fdk(G), is the minimum cardinality of a kFD-set. A fair dominating
Hajian Majid, Rad Nader Jafari
doaj +1 more source