Results 31 to 40 of about 11,796 (253)
Algorithmic Aspects of Secure Connected Domination in Graphs
Discussiones Mathematicae Graph Theory, 2021 Let G = (V, E) be a simple, undirected and connected graph. A connected dominating set S ⊆ V is a secure connected dominating set of G, if for each u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E and the set (S \ {v}) ∪ {u} is a connected dominating ...
Kumar Jakkepalli Pavan +1 more
doaj +1 more source
Heroes in Orientations of Chordal Graphs
SIAM Journal on Discrete Mathematics, 2022 We characterize all digraphs $H$ such that orientations of chordal graphs with no induced copy of $H$ have bounded dichromatic number.
Pierre Aboulker +2 more
openaire +4 more sources
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
Minimal toughness in special graph classes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Let $t$ be a positive real number. A graph is called $t$-tough if the removal of any vertex set $S$ that disconnects the graph leaves at most $|S|/t$ components, and all graphs are considered 0-tough. The toughness of a graph is the largest $t$ for which
Gyula Y. Katona, Kitti Varga
doaj +1 more source
Maxclique and Unit Disk Characterizations of Strongly Chordal Graphs
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 +1 more source
On chordal graph and line graph squares [PDF]
Discrete Applied Mathematics, 2018 In this work we investigate the chordality of squares and line graph squares of graphs. We prove a sufficient condition for the chordality of squares of graphs not containing induced cycles of length at least five. Moreover, we characterize the chordality of graph squares by forbidden subgraphs.
Robert Scheidweiler +1 more
openaire +2 more sources
Discrete Applied Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tínaz Ekim +3 more
openaire +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
Bipartite powers of k-chordal graphs [PDF]
, 2012 Let k be an integer and k \geq 3. A graph G is k-chordal if G does not have an induced cycle of length greater than k. From the definition it is clear that 3-chordal graphs are precisely the class of chordal graphs. Duchet proved that, for every positive
Chandran, L. Sunil, Mathew, Rogers
core +2 more sources