publication . Preprint . 2017

Steiner Distance in Graphs--A Survey

Mao, Yaping;
Open Access English
  • Published: 18 Aug 2017
Abstract
Comment: 85 pages, 14 figures, 3 tables
Subjects
arXiv: Computer Science::Data Structures and AlgorithmsMathematics::Metric GeometryComputer Science::Computational Geometry
ACM Computing Classification System: MathematicsofComputing_DISCRETEMATHEMATICSTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYTheoryofComputation_GENERALHardware_INTEGRATEDCIRCUITS
free text keywords: Mathematics - Combinatorics
Related Organizations
Download from
57 references, page 1 of 4

[1] J. Akiyama and F. Harary, A graph and its complement with specified properties, Internat. J. Math. & Math. Sci. 2(2) (1979), 223-228. [OpenAIRE]

[2] P. Ali, The Steiner diameter of a graph with prescribed girth, Discrete Math. 313(12) (2013), 1322-1326.

[3] H.H. Ali, A. Boals, and N.S. Sherwani, Distance stable graphs, Paper read at 2nd Internat. Conf. in Graph Theory, Combinatorics, Algorithms and Applications, San Francisco, 1989.

[4] P. Ali, P. Dankelmann, and S. Mukwembi, Upper bounds on the Steiner diameter of a graph, Discrete Appl. Math. 160 (2012), 1845-1850. [OpenAIRE]

[5] P. Ali, S. Mukwembi, and P. Dankelmann, Steiner diameter of 3, 4 and 5-connected maximal planar graphs, Discrete Appl. Math. 179 (2014), 222-228.

[6] B.S. Anand, M. Changat, S. Klavˇzar, I. Peterin, Convex sets in lexicographic product of graphs, Graphs Combin. 28 (2012), 77-84.

[7] J. M. Anthonisse, The rush in a directed graph, Technical Report BN 9/71, Stiching Math. Centrum, Amsterdam, October 1971. [OpenAIRE]

[8] M. Aouchiche and P. Hansen, A survey of Nordhaus-Gaddum type relations, Discrete Appl. Math. 161 (2013), 466-546. [OpenAIRE]

[9] M. Atici, Computational complexity of geodetic set, Internat. J. Comput. Math. 79 (2002), 587-591. [OpenAIRE]

[10] S.P. Avann, Metric ternary distributive semi-lattices, Proc. Amer. Math. Sot. 12 (l961), 407-414.

[11] H. J. Bandelt and H. M. Mulder, Distance-hereditary graphs, J. Combin. Theory B 41 (1986), 183-208. [OpenAIRE]

[12] A. Brandst¨adt, V.B. Le, and J.P. Spinrad, Graph Classes: A Survey, SIAM Monograph on Discrete Mathematics and Applications, Philidelphia, 1999.

[13] F. Bao, Y. Igarashi, and S.R. O¨hring, Reliable broadcasting in product networks, Discrete Applied Math. 83 (1998), 3-20.

[17] B. Bollob´as, Extremal Graph Theory, Acdemic press, 1978.

[19] J.A. Bondy and U.S.R. Murty, Graph Theory, GTM 244, Springer, 2008.

57 references, page 1 of 4
Any information missing or wrong?Report an Issue