Results 11 to 20 of about 1,986,691 (177)
Maxclique and Unit Disk Characterizations of Strongly Chordal Graphs [PDF]
Discussiones Mathematicae Graph Theory, 2014 Maxcliques (maximal complete subgraphs) and unit disks (closed neighborhoods of vertices) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new ...
Caria Pablo De, McKee Terry A.
doaj +3 more sources
Further results on Hendry's Conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 Recently, a conjecture due to Hendry was disproved which stated that every Hamiltonian chordal graph is cycle extendible. Here we further explore the conjecture, showing that it fails to hold even when a number of extra conditions are imposed.
Manuel Lafond +2 more
doaj +1 more source
Efficient (j, k)-Dominating Functions
Discussiones Mathematicae Graph Theory, 2023 For positive integers j and k, an efficient (j, k)-dominating function of a graph G = (V, E) is a function f : V → {0, 1, 2, . . ., j} such that the sum of function values in the closed neighbourhood of every vertex equals k. The relationship between the
Klostermeyer William F. +3 more
doaj +1 more source
Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same. The graph $G$ is rainbow-connected if there is a rainbow path between every pair of vertices.
Melissa Keranen, Juho Lauri
doaj +1 more source
On the multipacking number of grid graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 In 2001, Erwin introduced broadcast domination in graphs. It is a variant of classical domination where selected vertices may have different domination powers. The minimum cost of a dominating broadcast in a graph $G$ is denoted $\gamma_b(G)$.
Laurent Beaudou, Richard C. Brewster
doaj +1 more source
On Minimum Maximal Distance-k Matchings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study the computational complexity of several problems connected with finding a maximal distance-$k$ matching of minimum cardinality or minimum weight in a given graph. We introduce the class of $k$-equimatchable graphs which is an edge analogue of $k$
Yury Kartynnik, Andrew Ryzhikov
doaj +1 more source
Total Roman domination on the digraphs
Open Mathematics, 2023 Let D=(V,A)D=\left(V,A) be a simple digraph with vertex set VV, arc set AA, and no isolated vertex. A total Roman dominating function (TRDF) of DD is a function h:V→{0,1,2}h:V\to \left\{0,1,2\right\}, which satisfies that each vertex x∈Vx\in V with h(x ...
Zhang Xinhong, Song Xin, Li Ruijuan
doaj +1 more source
Generating Chordal Graphs Included in Given Graphs [PDF]
, 2006 A chordal graph is a graph which contains no chordless cycle of at least four edges as an induced subgraph. The class of chordal graphs contains many famous graph classes such as trees, interval graphs, and split graphs, and is also a subclass of perfect
KIYOMI, Masashi, UNO, Takeaki
core +1 more source
Linear-time counting algorithms for independent sets in chordal graphs [PDF]
, 2005 We study some counting and enumeration problems for chordal graphs, especially concerning independent sets. We first provide the following efficient algorithms for a chordal graph: (1) a linear-time algorithm for counting the number of independent sets; (
Ryuhei Uehara +5 more
core +1 more source
Complexity of Hamiltonian Cycle Reconfiguration
Algorithms, 2018 The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles C 0 and C t of a graph G, whether there is a sequence of Hamiltonian cycles C 0 , C 1 , … , C t such that C i can be obtained ...
Asahi Takaoka
doaj +1 more source