Some remarks on the geodetic number of a graph. (English) Zbl 1209.05129
Summary: A set of vertices \(D\) of a graph \(G\) is geodetic if every vertex of \(G\) lies on a shortest path between two not necessarily distinct vertices in \(D\). The geodetic number of \(G\) is the minimum cardinality of a geodetic set of \(G\).
We prove that it is NP-complete to decide for a given chordal or chordal bipartite graph \(G\) and a given integer \(k\) whether \(G\) has a geodetic set of cardinality at most \(k\). Furthermore, we prove an upper bound on the geodetic number of graphs without short cycles and study the geodetic number of cographs, split graphs, and unit interval graphs.
We prove that it is NP-complete to decide for a given chordal or chordal bipartite graph \(G\) and a given integer \(k\) whether \(G\) has a geodetic set of cardinality at most \(k\). Furthermore, we prove an upper bound on the geodetic number of graphs without short cycles and study the geodetic number of cographs, split graphs, and unit interval graphs.
References:
| [1] | Alon, N.; Spencer, J. H., The Probabilistic Method. With an Appendix on the Life and Work of Paul Erdős (2008), John Wiley & Sons · Zbl 1148.05001 |
| [2] | Atici, M., Graph operations and geodetic numbers, Congr. Numer., 141, 95-110 (1999) · Zbl 0968.05024 |
| [3] | Atici, M., Computational complexity of geodetic set, Int. J. Comput. Math., 79, 587-591 (2002) · Zbl 0999.05027 |
| [4] | Bogart, K. P.; West, D. B., A short proof that ‘proper=unit’, Discrete Math., 201, 21-23 (1999) · Zbl 0932.05065 |
| [5] | Booth, K. S.; Johnson, J. H., Dominating sets in chordal graphs, SIAM J. Comput., 11, 191-199 (1982) · Zbl 0485.05055 |
| [6] | Brandstädt, A.; Le, V. B.; Spinrad, J. P., Graph classes: A survey, SIAM Monogr. Discrete Math., 304 (1999) · Zbl 0919.05001 |
| [7] | Cáceres, J.; Hernando, M. C.; Mora, M.; Pelayo, I. M.; Puertas, M. L.; Seara, C., On geodetic sets formed by boundary vertices, Discrete Math., 306, 188-198 (2006) · Zbl 1084.05025 |
| [8] | Chartrand, G.; Harary, F.; Zhang, P., Extremal problems in geodetic graph theory, Congr. Numer., 131, 55-66 (1998) · Zbl 0951.05056 |
| [9] | Chartrand, G.; Harary, F.; Zhang, P., On the geodetic number of a graph, Networks, 39, 1-6 (2002) · Zbl 0987.05047 |
| [10] | Chartrand, G.; Palmer, E. M.; Zhang, P., The geodetic number of a graph: A survey, Congr. Numer., 156, 37-58 (2002) · Zbl 1027.05033 |
| [11] | Deng, X.; Hell, P.; Huang, J., Linear-time representation algorithms for proper circular-arc graphs and proper interval graphs, SIAM J. Comput., 25, 390-403 (1996) · Zbl 0858.05094 |
| [12] | Harary, F.; Loukakis, E.; Tsouros, C., The geodetic number of a graph, Math. Comput. Modelling, 17, 89-95 (1993) · Zbl 0825.68490 |
| [13] | Hernando, C.; Jiang, T.; Mora, M.; Pelayo, I. M.; Seara, C., On the Steiner, geodetic and hull numbers of graphs, Discrete Math., 293, 139-154 (2005) · Zbl 1062.05052 |
| [14] | R.M. McConnell, J.P. Spinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, in: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 536-545; R.M. McConnell, J.P. Spinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, in: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 536-545 · Zbl 0867.05068 |
| [15] | McConnell, R. M.; Spinrad, J. P., Ordered vertex partitioning, Discrete Math. Theor. Comput. Sci., 4, 45-60 (2000) · Zbl 0946.68101 |
| [16] | Müller, H.; Brandstädt, A., The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs, Theor. Comput. Sci., 53, 257-265 (1987) · Zbl 0638.68062 |
| [17] | Roberts, F. S., Indifference graphs, (Proof Techniques in Graph Theory (1969), Academic Press) · Zbl 0193.24205 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
