Graphs with Bounded Induced Distance
In this work we introduce graphs with bounded induced distance of order k (BID(k) for short). In any graph belonging to BID(k), the length of every induced path between every pair of nodes is at most k times the distance between the same nodes. In communication networks modeled by these graphs any message can be always delivered through a path whose length is at most k times the best possible one, even if some nodes fail.
In this work we first provide a characterization of graphs in BID(k) by means of cycle-chord conditions. After that, we investigate classes with order k ≤ 2. In this context, we note that the class BID(1) is the well known class of distance-hereditary graphs, and show that 3/2 is a lower bound for the order k of graphs that are not distance-hereditary. Then we characterize graphs in BID(2/3) by means of their minimal forbidden induced subgraphs, and we also show that graphs in BID(2) have a more complex characterization. We prove that the recognition problem for the generic class BID(k) is Co-NP-complete. Finally, we show that the split composition can be used to generate graphs in BID(k).
KeywordsShort Path Steiner Tree Recognition Problem Node Failure Graph Class
Unable to display preview. Download preview PDF.
- 1.Bandelt, H.J., D’Atri, A., Moscarini, M., Mulder, H.M., Schultze, A.: Operations on distance hereditary graphs. Technical Report 226, CNR, Istituto di Analisi dei Sistemi e Informatica del CNR, Rome Italy (1988)Google Scholar
- 4.Brandstädt, A.: Special graph classes. Technical Report SM-DU-199, University Duisburg (1993)Google Scholar
- 5.Brandstädt, A., Dragan, F.F.: A linear time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs. Technical Report SM-DU-261, University Duisburg (1994)Google Scholar
- 6.Cicerone, S., Di Stefano, G.: Graph classes between parity and distance-hereditary graphs. In: 1st Discrete Mathematics and Theoretical Computer Science (DMTCS 1996), Combinatorics, Complexity, and Logic, pp. 168–181. Springer, Heidelberg (1996)Google Scholar
- 7.Cicerone, S., Di Stefano, G.: Port and node support to compact routing. Technical Report R.97-17, Dipartimento di Ingegneria Elettrica, Universitá di L’Aquila, L’Aquila, Italy (1997)Google Scholar
- 10.Di Stefano, G.: A routing algorithm for networks based on distance-hereditary topologies. In: 3rd Int. Colloquium on Structural Information and Communication Complexity, SIROCCO 1996 (1996)Google Scholar
- 11.Dragan, F.F.: Dominating cliques in distance-hereditary graphs. In: Schmidt, E.M., Skyum, S. (eds.) SWAT 1994. LNCS, vol. 824, pp. 370–381. Springer, Heidelberg (1994)Google Scholar
- 20.Nicolai, F.: Hamiltonian problems on distance-hereditary graphs. Technical Report SM-DU-264, University Duisburg (1994)Google Scholar