메뉴 건너뛰기




Volumn , Issue , 2011, Pages 49-72

Distance in graphs

Author keywords

Diameter; Distance; Graph; Radius; Steiner distance

Indexed keywords


EID: 84874967008     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-0-8176-4789-6_3     Document Type: Chapter
Times cited : (96)

References (77)
  • 1
    • 38249020037 scopus 로고
    • Average distances in undirected graphs and the removal of vertices
    • Althöfer I (1990) Average distances in undirected graphs and the removal of vertices. J Combin Theory B 48(1):140-142
    • (1990) J Combin Theory B , vol.48 , Issue.1 , pp. 140-142
    • Althöfer, I.1
  • 5
    • 84986432819 scopus 로고
    • Average distance in graphs with removed elements
    • Bienstock D, Györi E (1988) Average distance in graphs with removed elements. J Graph Theory 12(3):375-390
    • (1988) J Graph Theory , vol.12 , Issue.3 , pp. 375-390
    • Bienstock, D.1    Györi, E.2
  • 6
    • 24344463510 scopus 로고    scopus 로고
    • A survey of models of the web graph
    • Lecture notes in computer science. Springer, Berlin
    • Bonato A (2005) A survey of models of the web graph. In: Combinatorial and algorithmic aspects of networking, vol 3405, Lecture notes in computer science. Springer, Berlin, pp 159-172
    • (2005) Combinatorial and Algorithmic Aspects of Networking , vol.3405 , pp. 159-172
    • Bonato, A.1
  • 7
    • 0003953404 scopus 로고
    • Addison-Wesley Publishing Company Advanced Book Program, Redwood City, CA
    • Buckley F, Harary F (1990) Distance in graphs. Addison-Wesley Publishing Company Advanced Book Program, Redwood City, CA
    • (1990) Distance in Graphs
    • Buckley, F.1    Harary, F.2
  • 8
    • 84986439509 scopus 로고
    • A note on graphs with diameter-preserving spanning trees
    • Buckley F, Lewinter M (1988) A note on graphs with diameter-preserving spanning trees. J Graph Theory 12(4):525-528
    • (1988) J Graph Theory , vol.12 , Issue.4 , pp. 525-528
    • Buckley, F.1    Lewinter, M.2
  • 9
    • 0000008199 scopus 로고
    • On graphs containing a given graph as center
    • Buckley F, Miller Z, Slater PJ (1981) On graphs containing a given graph as center. J Graph Theory 5:427-432
    • (1981) J Graph Theory , vol.5 , pp. 427-432
    • Buckley, F.1    Miller, Z.2    Slater, P.J.3
  • 11
    • 70349110575 scopus 로고    scopus 로고
    • On 3-Steiner simplicial orderings
    • Cáceres J, Oellermann OR (2009) On 3-Steiner simplicial orderings. Discrete Math 309:5828-5833
    • (2009) Discrete Math , vol.309 , pp. 5828-5833
    • Cáceres, J.1    Oellermann, O.R.2
  • 14
    • 84986528172 scopus 로고
    • The average distance and the independence number of a graph
    • Chung F R K (1988) The average distance and the independence number of a graph. J Graph Theory 12:229-235
    • (1988) J Graph Theory , vol.12 , pp. 229-235
    • Chung, F.R.K.1
  • 15
  • 16
    • 0019565510 scopus 로고
    • Linear algorithms for finding the Jordan center and path center of a tree
    • Cockayne EJ, Hedetniemi SM, Hedetniemi ST (1981) Linear algorithms for finding the Jordan center and path center of a tree. Transport Sci 15:98-11417.
    • (1981) Transport Sci , vol.15 , pp. 98-11417
    • Cockayne, E.J.1    Hedetniemi, S.M.2    Hedetniemi, S.T.3
  • 19
    • 67349171198 scopus 로고    scopus 로고
    • Minimum average distance of strong orientations of graphs
    • Dankelmann P, Oellermann OR, Wu J-L (2004) Minimum average distance of strong orientations of graphs. Discrete Appl Math 143:204-212
    • (2004) Discrete Appl Math , vol.143 , pp. 204-212
    • Dankelmann, P.1    Oellermann, O.R.2    Wu, J.-L.3
  • 20
    • 0024019980 scopus 로고
    • Steiner trees and connected domination
    • D'Atri A, Moscarini M (1988) Steiner trees and connected domination. SIAM J Discrete Math 17:521-538
    • (1988) SIAM J Discrete Math , vol.17 , pp. 521-538
    • D'Atri, A.1    Moscarini, M.2
  • 22
    • 49449129161 scopus 로고
    • Mean distance in a graph
    • Doyle JK, Graver JE (1977) Mean distance in a graph. Discrete Math 7(2):147-154
    • (1977) Discrete Math , vol.7 , Issue.2 , pp. 147-154
    • Doyle, J.K.1    Graver, J.E.2
  • 27
    • 0348246140 scopus 로고
    • On two conjectures of GRAFFITI
    • Fajtlowicz S (1986) On two conjectures of GRAFFITI. Congr Numer 55:51-56
    • (1986) Congr Numer , vol.55 , pp. 51-56
    • Fajtlowicz, S.1
  • 28
    • 0013059546 scopus 로고
    • On conjectures of GRAFFITI II
    • Fajtlowicz S (1987) On conjectures of GRAFFITI II. Congr Numer 60:187-197
    • (1987) Congr Numer , vol.60 , pp. 187-197
    • Fajtlowicz, S.1
  • 30
    • 84986947073 scopus 로고
    • Edge-vulnerability and mean distance
    • Favaron O, Kouider M, Mahéo M (1989) Edge-vulnerability and mean distance. Networks 19(5):493-504
    • (1989) Networks , vol.19 , Issue.5 , pp. 493-504
    • Favaron, O.1    Kouider, M.2    Mahéo, M.3
  • 31
    • 84945709831 scopus 로고
    • Algorithm 97: Shortest path
    • Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5:345
    • (1962) Commun ACM , vol.5 , pp. 345
    • Floyd, R.W.1
  • 32
    • 33750177351 scopus 로고
    • Centrality in social networks: Conceptual clarification
    • Freeman LC (1978/1979) Centrality in social networks: conceptual clarification. Soc Networks 1:215-239
    • (1978) Soc Networks , vol.1 , pp. 215-239
    • Freeman, L.C.1
  • 35
    • 77954480482 scopus 로고    scopus 로고
    • On the graphs with maximum distance or k-diameter
    • Goddard W, Swart CS, Swart HC (2005) On the graphs with maximum distance or k-diameter. Math Slovaca 55(2):131-139
    • (2005) Math Slovaca , vol.55 , Issue.2 , pp. 131-139
    • Goddard, W.1    Swart, C.S.2    Swart, H.C.3
  • 36
    • 84892798683 scopus 로고
    • On Winkler's four thirds conjecture on mean distance in graphs
    • Györi E (1988) On Winkler's four thirds conjecture on mean distance in graphs. Congr Numer 61:259-262
    • (1988) Congr Numer , vol.61 , pp. 259-262
    • Györi, E.1
  • 38
    • 0002395291 scopus 로고
    • The maximum connectivity of a graph
    • Harary F (1962) The maximum connectivity of a graph. Proc Natl Acad Sci USA 48:1142-1146
    • (1962) Proc Natl Acad Sci USA , vol.48 , pp. 1142-1146
    • Harary, F.1
  • 39
    • 0007142156 scopus 로고
    • On the metric dimension of a graph
    • Harary F, Melter RA (1976) On the metric dimension of a graph. Ars Combinatoria 2:191-195
    • (1976) Ars Combinatoria , vol.2 , pp. 191-195
    • Harary, F.1    Melter, R.A.2
  • 40
    • 0001448098 scopus 로고
    • The dissimilarity characteristic of Husimi trees
    • Harary F, Norman RZ (1953) The dissimilarity characteristic of Husimi trees. Ann Math (2) 58:134-141
    • (1953) Ann Math (2) , vol.58 , pp. 134-141
    • Harary, F.1    Norman, R.Z.2
  • 41
    • 0000681580 scopus 로고
    • A characterization of distance-hereditary graphs
    • Howorka E (1977) A characterization of distance-hereditary graphs. Quart J Math Oxford 28:417-420
    • (1977) Quart J Math Oxford , vol.28 , pp. 417-420
    • Howorka, E.1
  • 44
    • 84942401057 scopus 로고
    • Sur les assembalges des lignes
    • Jordan C (1869) Sur les assembalges des lignes. J Reine Angew Math 70:185-190
    • (1869) J Reine Angew Math , vol.70 , pp. 185-190
    • Jordan, C.1
  • 46
    • 0031531132 scopus 로고    scopus 로고
    • Mean distance and minimum degree
    • Kouider M, Winkler P (1997) Mean distance and minimum degree. J Graph Theory 25:95-99
    • (1997) J Graph Theory , vol.25 , pp. 95-99
    • Kouider, M.1    Winkler, P.2
  • 47
    • 51649206131 scopus 로고
    • On dominance relations and the structure of animal societies. III. The condition for a score structure
    • Landau HG (1953) On dominance relations and the structure of animal societies. III. The condition for a score structure. Bull Math Biophys 15:143-148
    • (1953) Bull Math Biophys , vol.15 , pp. 143-148
    • Landau, H.G.1
  • 48
    • 0020787246 scopus 로고
    • On powers and centers of chordal graphs
    • Laskar R, Shier D (1983) On powers and centers of chordal graphs. Discrete Appl Math 6(2):139-147
    • (1983) Discrete Appl Math , vol.6 , Issue.2 , pp. 139-147
    • Laskar, R.1    Shier, D.2
  • 49
    • 0002215434 scopus 로고
    • Representation of a finite graph by a set of intervals on the real line
    • Lekkerkerker CG, Boland J (1962) Representation of a finite graph by a set of intervals on the real line. Fund Math 51:45-64
    • (1962) Fund Math , vol.51 , pp. 45-64
    • Lekkerkerker, C.G.1    Boland, J.2
  • 50
    • 0000550880 scopus 로고
    • On a combinatory detection problem. I. Magyar Tud Akad Mat Kutató
    • Lindström B (1964) On a combinatory detection problem. I. Magyar Tud Akad Mat Kutató Int Közl 9:195-207
    • (1964) Int Közl , vol.9 , pp. 195-207
    • Lindström, B.1
  • 53
    • 0010677524 scopus 로고
    • An edge version of the matrix-tree theorem and the Wiener index
    • Merris R (1989) An edge version of the matrix-tree theorem and the Wiener index. Linear Multilinear Algebra 25(4):291-296
    • (1989) Linear Multilinear Algebra , vol.25 , Issue.4 , pp. 291-296
    • Merris, R.1
  • 54
    • 0002427040 scopus 로고
    • Eigenvalues, diameter, and mean distance in graphs
    • Mohar B (1991) Eigenvalues, diameter, and mean distance in graphs. Graph Combinator 7(1):53-64
    • (1991) Graph Combinator , vol.7 , Issue.1 , pp. 53-64
    • Mohar, B.1
  • 56
    • 85008064408 scopus 로고
    • N-cubes and median graphs
    • Mulder HM (1980) n-cubes and median graphs. J Graph Theory 4:107-110
    • (1980) J Graph Theory , vol.4 , pp. 107-110
    • Mulder, H.M.1
  • 57
    • 0037712252 scopus 로고
    • On finite graphs of diameter 2
    • Ng CP, Teh HH (1966/1967) On finite graphs of diameter 2. Nanta Math 1:72-75
    • (1966) Nanta Math , vol.1 , pp. 72-75
    • Ng, C.P.1    Teh, H.H.2
  • 59
    • 84987584170 scopus 로고
    • From Steiner centers to Steiner medians
    • Oellermann OR (1995) From Steiner centers to Steiner medians. J Graph Theory 20(2):113-122
    • (1995) J Graph Theory , vol.20 , Issue.2 , pp. 113-122
    • Oellermann, O.R.1
  • 60
    • 84986516415 scopus 로고
    • Steiner centers in graphs
    • Oellermann OR, Tian S (1990) Steiner centers in graphs. J Graph Theory 14(5):585-597
    • (1990) J Graph Theory , vol.14 , Issue.5 , pp. 585-597
    • Oellermann, O.R.1    Tian, S.2
  • 62
    • 84986439448 scopus 로고
    • On the sum of all distance in a graph or digraph
    • Plesńik J (1984) On the sum of all distance in a graph or digraph. J Graph Theory 8:1-24
    • (1984) J Graph Theory , vol.8 , pp. 1-24
    • Plesńik, J.1
  • 63
    • 0001694277 scopus 로고
    • Questions, discussions, and notes: A theorem on graphs, with an application to a problem of traffic control
    • Robbins HE (1939) Questions, discussions, and notes: a theorem on graphs, with an application to a problem of traffic control. Am Math Mon 46(5):281-283
    • (1939) Am Math Mon , vol.46 , Issue.5 , pp. 281-283
    • Robbins, H.E.1
  • 64
    • 0010749222 scopus 로고    scopus 로고
    • Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods
    • Rodriguez JA, Yebra J L A (1999) Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods. Discrete Math 196 (1-3):267-275
    • (1999) Discrete Math , vol.196 , Issue.1-3 , pp. 267-275
    • Rodriguez, J.A.1    Yebra, J.L.A.2
  • 65
    • 4043098247 scopus 로고    scopus 로고
    • On metric generators of graphs
    • Sebö A, Tannier E (2004) On metric generators of graphs. Math Oper Res 29(2):383-393
    • (2004) Math Oper Res , vol.29 , Issue.2 , pp. 383-393
    • Sebö, A.1    Tannier, E.2
  • 66
    • 0001083131 scopus 로고
    • Leaves of trees
    • Slater PJ (1975) Leaves of trees. Congr Numer 14:549-559
    • (1975) Congr Numer , vol.14 , pp. 549-559
    • Slater, P.J.1
  • 67
    • 0001473091 scopus 로고
    • Centers to centroids in graphs
    • Slater PJ (1978) Centers to centroids in graphs. J Graph Theory 2:209-222
    • (1978) J Graph Theory , vol.2 , pp. 209-222
    • Slater, P.J.1
  • 68
    • 0042529084 scopus 로고
    • Centrality of paths and vertices in a graph: Cores and pits
    • Wiley, New York
    • Slater PJ (1981) Centrality of paths and vertices in a graph: cores and pits. In: The theory and applications of graphs. Wiley, New York, pp 529-542
    • (1981) The Theory and Applications of Graphs , pp. 529-542
    • Slater, P.J.1
  • 69
    • 0039748558 scopus 로고
    • Transmission in graphs: A bound and vertex removing
    • Soltés L (1991) Transmission in graphs: a bound and vertex removing. Math Slovaca 41(1):11-16
    • (1991) Math Slovaca , vol.41 , Issue.1 , pp. 11-16
    • Soltés, L.1
  • 71
    • 40349099622 scopus 로고
    • On the number of edges in a graph with a given radius
    • Vizing VG (1967) On the number of edges in a graph with a given radius. Dokl Akad Nauk SSSR 173:1245-1246
    • (1967) Dokl Akad Nauk SSSR , vol.173 , pp. 1245-1246
    • Vizing, V.G.1
  • 72
    • 8544254107 scopus 로고
    • Structural determination of paraffin boiling points
    • Wiener H (1947) Structural determination of paraffin boiling points. J Am Chem Soc 69(1):17-20
    • (1947) J Am Chem Soc , vol.69 , Issue.1 , pp. 17-20
    • Wiener, H.1
  • 73
    • 0348246138 scopus 로고
    • Mean distance and the four thirds conjecture
    • Winkler P (1986) Mean distance and the four thirds conjecture. Congr Numer 54:53-61
    • (1986) Congr Numer , vol.54 , pp. 53-61
    • Winkler, P.1
  • 74
    • 84892815974 scopus 로고
    • Graph theory in memory of G. A. Dirac
    • Denmark, 1985, Ann Discrete Math, North-Holland, Amsterdam
    • Winkler P (1989) Graph theory in memory of G. A. Dirac. In: Proceedings of meeting in Sandbjerg, Denmark, 1985, Ann Discrete Math, North-Holland, Amsterdam
    • (1989) Proceedings of Meeting in Sandbjerg
    • Winkler, P.1
  • 75
    • 84987034438 scopus 로고
    • Steiner problem in networks: A survey
    • Winter P (1987) Steiner problem in networks: a survey. Networks 17:129-167
    • (1987) Networks , vol.17 , pp. 129-167
    • Winter, P.1
  • 76
    • 0002852014 scopus 로고
    • Worst-case analysis of network design problem heuristics
    • Wong R (1980) Worst-case analysis of network design problem heuristics. SIAM J Algebra Discrete Methods 1:51-63
    • (1980) SIAM J Algebra Discrete Methods , vol.1 , pp. 51-63
    • Wong, R.1
  • 77
    • 0002750931 scopus 로고
    • Medians and peripherians of trees
    • Zelinka B (1968) Medians and peripherians of trees. Arch Math (Brno) 4:87-95
    • (1968) Arch Math (Brno) , vol.4 , pp. 87-95
    • Zelinka, B.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.