35 research outputs found
Packing Strong Subgraph in Digraphs
In this paper, we study two types of strong subgraph packing problems in
digraphs, including internally disjoint strong subgraph packing problem and
arc-disjoint strong subgraph packing problem. These problems can be viewed as
generalizations of the famous Steiner tree packing problem and are closely
related to the strong arc decomposition problem. We first prove the
NP-completeness for the internally disjoint strong subgraph packing problem
restricted to symmetric digraphs and Eulerian digraphs. Then we get
inapproximability results for the arc-disjoint strong subgraph packing problem
and the internally disjoint strong subgraph packing problem. Finally we study
the arc-disjoint strong subgraph packing problem restricted to digraph
compositions and obtain some algorithmic results by utilizing the structural
properties
Connected Domination Critical Graphs
This thesis investigates the structure of connected domination critical graphs. The characterizations developed provide an important theoretical framework for addressing a number of difficult computational problems in the areas of operations research (for example, facility locations, industrial production systems), security, communication and wireless networks, transportation and logistics networks, land surveying and computational biology. In these application areas, the problems of interest are modelled by networks and graph parameters such as domination numbers reflect the efficiency and performance of the systems
07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs
From 8th to 13th July 2007, the Dagstuhl Seminar ``Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
Distances and Domination in Graphs
This book presents a compendium of the 10 articles published in the recent Special Issue “Distance and Domination in Graphs”. The works appearing herein deal with several topics on graph theory that relate to the metric and dominating properties of graphs. The topics of the gathered publications deal with some new open lines of investigations that cover not only graphs, but also digraphs. Different variations in dominating sets or resolving sets are appearing, and a review on some networks’ curvatures is also present