• DML-CZ Home

05C12 Distance in graphs (85 articles)

• Mesežnikov, Dávid: A construction of large graphs of diameter two and given degree from Abelian lifts of dipoles. (English). Kybernetika, vol. 48 (2012), issue 3, pp. 518-521
• Fujie-Okamoto, Futaba; Renzema, Willem; Zhang, Ping: The $k$-metric colorings of a graph. (English). Mathematica Bohemica, vol. 137 (2012), issue 1, pp. 45-63
• Li, Shuxian; Zhou, Bo: Ordering the non-starlike trees with large reverse Wiener indices. (English). Czechoslovak Mathematical Journal, vol. 62 (2012), issue 1, pp. 215-233
• Okamoto, Futaba; Phinezy, Bryan; Zhang, Ping: The local metric dimension of a graph. (English). Mathematica Bohemica, vol. 135 (2010), issue 3, pp. 239-255
• Avart, C.; Komjath, P.; Rödl, V.: Metric spaces with point character equal to their size. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 51 (2010), issue 3, pp. 459-467
• Ždímalová, Mária; Staneková, Ľubica: Asymptotic comparison of two constructions for large digraphs of given degree and diameter. (English). Acta Mathematica Universitatis Ostraviensis, vol. 17 (2009), issue 1, pp. 5-9
• Kola, Srinivasa Rao; Panigrahi, Pratima: Nearly antipodal chromatic number $ac'(P_n)$ of the path $P_n$. (English). Mathematica Bohemica, vol. 134 (2009), issue 1, pp. 77-86
• Draganova, Anna: Results on $F$-continuous graphs. (English). Czechoslovak Mathematical Journal, vol. 59 (2009), issue 1, pp. 51-60
• Lin, Chiang; Shang, Jen-Ling: Statuses and branch-weights of weighted trees. (English). Czechoslovak Mathematical Journal, vol. 59 (2009), issue 4, pp. 1019-1025
• Henning, Michael A.; Mynhardt, Christina M.: The diameter of paired-domination vertex critical graphs. (English). Czechoslovak Mathematical Journal, vol. 58 (2008), issue 4, pp. 887-897
• Nebeský, Ladislav: On the distance function of a connected graph. (English). Czechoslovak Mathematical Journal, vol. 58 (2008), issue 4, pp. 1101-1106
• Okamoto, Futaba; Zhang, Ping: On upper traceable numbers of graphs. (English). Mathematica Bohemica, vol. 133 (2008), issue 4, pp. 389-405
• Okamoto, Futaba; Zhang, Ping; Saenpholphat, Varaporn: The upper traceable number of a graph. (English). Czechoslovak Mathematical Journal, vol. 58 (2008), issue 1, pp. 271-287
• Lin, Chiang; Ou, Wei-Bo: A note on degree-continuous graphs. (English). Czechoslovak Mathematical Journal, vol. 57 (2007), issue 3, pp. 1043-1047
• Raczek, Joanna; Lemańska, Magdalena; Cyman, Joanna: Lower bound on the distance $k$-domination number of a tree. (English). Mathematica Slovaca, vol. 56 (2006), issue 2, pp. 235-243
• Saenpholphat, Varaporn; Okamoto, Futaba; Zhang, Ping: Measures of traceability in graphs. (English). Mathematica Bohemica, vol. 131 (2006), issue 1, pp. 63-84
• Nebeský, Ladislav: Signpost systems and spanning trees of graphs. (English). Czechoslovak Mathematical Journal, vol. 56 (2006), issue 3, pp. 885-893
• Nebeský, Ladislav: Travel groupoids. (English). Czechoslovak Mathematical Journal, vol. 56 (2006), issue 2, pp. 659-675
• Vacek, Ondrej: Diameter-invariant graphs. (English). Mathematica Bohemica, vol. 130 (2005), issue 4, pp. 355-370
• Khennoufa, Riadh; Togni, Olivier: A note on radio antipodal colourings of paths. (English). Mathematica Bohemica, vol. 130 (2005), issue 3, pp. 277-282
• Nebeský, Ladislav: On signpost systems and connected graphs. (English). Czechoslovak Mathematical Journal, vol. 55 (2005), issue 2, pp. 283-293
• Janakiraman, T. N.; Muthammai, S.; Bhanumathi, M.: On the Boolean function graph of a graph and on its complement. (English). Mathematica Bohemica, vol. 130 (2005), issue 2, pp. 113-134
• Goddard, Wayne; Swart, Christine S.; Swart, Henda C.: On the graphs with maximum distance or $k$-diameter. (English). Mathematica Slovaca, vol. 55 (2005), issue 2, pp. 131-139
• Nebeský, Ladislav: The directed geodetic structure of a strong digraph. (English). Czechoslovak Mathematical Journal, vol. 54 (2004), issue 1, pp. 1-8
• Saenpholphat, Varaporn; Zhang, Ping: On connected resolving decompositions in graphs. (English). Czechoslovak Mathematical Journal, vol. 54 (2004), issue 3, pp. 681-696
• Nebeský, Ladislav: On properties of a graph that depend on its distance function. (English). Czechoslovak Mathematical Journal, vol. 54 (2004), issue 2, pp. 445-456
• Bálint, V.; Vacek, O.: Radius-invariant graphs. (English). Mathematica Bohemica, vol. 129 (2004), issue 4, pp. 361-377
• Saenpholphat, Varaporn; Zhang, Ping: Connected resolvability of graphs. (English). Czechoslovak Mathematical Journal, vol. 53 (2003), issue 4, pp. 827-840
• Saenpholphat, Varaporn; Zhang, Ping: Connected resolving decompositions in graphs. (English). Mathematica Bohemica, vol. 128 (2003), issue 2, pp. 121-136
• Chartrand, G.; Saenpholphat, V.; Zhang, P.: The independent resolving number of a graph. (English). Mathematica Bohemica, vol. 128 (2003), issue 4, pp. 379-393
• Brigham, Robert C.; Chartrand, Gary; Dutton, Ronald D.; Zhang, Ping: Resolving domination in graphs. (English). Mathematica Bohemica, vol. 128 (2003), issue 1, pp. 25-36
• Berrachedi, Abdelhafid; Havel, Ivan; Mulder, Henry Martyn: Spherical and clockwise spherical graphs. (English). Czechoslovak Mathematical Journal, vol. 53 (2003), issue 2, pp. 295-309
• Chartrand, Gary; Zhang, Ping: Extreme geodesic graphs. (English). Czechoslovak Mathematical Journal, vol. 52 (2002), issue 4, pp. 771-780
• Nebeský, Ladislav: New proof of a characterization of geodetic graphs. (English). Czechoslovak Mathematical Journal, vol. 52 (2002), issue 1, pp. 33-39
• Zhang, Ping: On $k$-strong distance in strong digraphs. (English). Mathematica Bohemica, vol. 127 (2002), issue 4, pp. 557-570
• Brešar, Boštjan; Klavžar, Sandi: On partial cubes and graphs with convex intervals. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 43 (2002), issue 3, pp. 537-545
• Chartrand, Gary; Erwin, David; Zhang, Ping: Radio antipodal colorings of graphs. (English). Mathematica Bohemica, vol. 127 (2002), issue 1, pp. 57-69
• Changat, Manoj; Klavžar, Sandi; Mulder, Henry Martyn: The all-paths transit function of a graph. (English). Czechoslovak Mathematical Journal, vol. 51 (2001), issue 2, pp. 439-448
• Nebeský, Ladislav: A characterization of the interval function of a (finite or infinite) connected graph. (English). Czechoslovak Mathematical Journal, vol. 51 (2001), issue 3, pp. 635-642
• Gimbel, John; Zhang, Ping: Degree-continuous graphs. (English). Czechoslovak Mathematical Journal, vol. 51 (2001), issue 1, pp. 163-171
• Chartrand, Gary; Jarrett, Elzbieta B.; Saba, Farrokh; Salehi, Ebrahim; Zhang, Ping: $F$-continuous graphs. (English). Czechoslovak Mathematical Journal, vol. 51 (2001), issue 2, pp. 351-361
• Chartrand, Gary; Zhang, Ping: The forcing convexity number of a graph. (English). Czechoslovak Mathematical Journal, vol. 51 (2001), issue 4, pp. 847-858
• Chartrand, Gary; Zhang, Ping: The forcing dimension of a graph. (English). Mathematica Bohemica, vol. 126 (2001), issue 4, pp. 711-720
• Chartrand, Gary; Zhang, Ping: $H$-convex graphs. (English). Mathematica Bohemica, vol. 126 (2001), issue 1, pp. 209-220
• Nebeský, Ladislav: The interval function of a connected graph and a characterization of geodetic graphs. (English). Mathematica Bohemica, vol. 126 (2001), issue 1, pp. 247-254
• Changat, Manoj; Mulder, Henry Martyn: Route systems on graphs. (English). Mathematica Bohemica, vol. 126 (2001), issue 3, pp. 607-612
• Winters, Steven J.: Strong asymmetric digraphs with prescribed interior and annulus. (English). Czechoslovak Mathematical Journal, vol. 51 (2001), issue 4, pp. 831-846
• Nebeský, Ladislav: An axiomatic approach to metric properties of connected graphs. (English). Czechoslovak Mathematical Journal, vol. 50 (2000), issue 1, pp. 3-14
• Chartrand, Gary; Raines, Michael; Zhang, Ping: The directed distance dimension of oriented graphs. (English). Mathematica Bohemica, vol. 125 (2000), issue 2, pp. 155-168
• Chartrand, Gary; Hansen, Lisa; Rashidi, Reza; Sherwani, Naveed: Distance in stratified graphs. (English). Czechoslovak Mathematical Journal, vol. 50 (2000), issue 1, pp. 35-46
• Kyš, Peter: Graphs with the same peripheral and center eccentric vertices. (English). Mathematica Bohemica, vol. 125 (2000), issue 3, pp. 331-339
• Zelinka, Bohdan: On a problem concerning stratified graphs. (English). Czechoslovak Mathematical Journal, vol. 50 (2000), issue 1, pp. 47-49
• Gliviak, Ferdinand: On radially extremal graphs and digraphs, a survey. (English). Mathematica Bohemica, vol. 125 (2000), issue 2, pp. 215-225
• Simić, Slobodan; Gutman, Ivan; Baltić, Vladimir: Some graphs with extremal Szeged index. (English). Mathematica Slovaca, vol. 50 (2000), issue 1, pp. 1-15
• Nebeský, Ladislav: A theorem for an axiomatic approach to metric properties of graphs. (English). Czechoslovak Mathematical Journal, vol. 50 (2000), issue 1, pp. 121-133
• Nebeský, Ladislav: An algebraic characterization of geodetic graphs. (English). Czechoslovak Mathematical Journal, vol. 48 (1998), issue 4, pp. 701-710
• Nebeský, Ladislav: Characterizing the interval function of a connected graph. (English). Mathematica Bohemica, vol. 123 (1998), issue 2, pp. 137-144
• Nebeský, Ladislav: A new proof of a characterization of the set of all geodesics in a connected graph. (English). Czechoslovak Mathematical Journal, vol. 48 (1998), issue 4, pp. 809-813
• Zelinka, Bohdan: Circular distance in directed graphs. (English). Mathematica Bohemica, vol. 122 (1997), issue 2, pp. 113-119
• Nebeský, Ladislav: Geodesics and steps in a connected graph. (English). Czechoslovak Mathematical Journal, vol. 47 (1997), issue 1, pp. 149-161
• Klavžar, Sandi; Milutinović, Uroš: Graphs $S(n,k)$ and a variant of the Tower of Hanoi problem. (English). Czechoslovak Mathematical Journal, vol. 47 (1997), issue 1, pp. 95-104
• Chartrand, Gary; Gavlas, Heather; Schulz, Kelly; Winters, Steve J.: On strong digraphs with a prescribed ultracenter. (English). Czechoslovak Mathematical Journal, vol. 47 (1997), issue 1, pp. 83-94
• Zelinka, Bohdan: On two transformations of graphs. (English). Mathematica Bohemica, vol. 122 (1997), issue 4, pp. 357-363
• Chartrand, Gary; Gavlas, Heather; Henning, Michael A.; Rashidi, Reza: Stratidistance in stratified graphs. (English). Mathematica Bohemica, vol. 122 (1997), issue 4, pp. 337-347
• Gliviak, Ferdinand: Two classes of graphs related to extremal eccentricities. (English). Mathematica Bohemica, vol. 122 (1997), issue 3, pp. 231-241
• Haviar, Alfonz; Klenovčan, Pavel: A metric on a system of ordered sets. (English). Mathematica Bohemica, vol. 121 (1996), issue 2, pp. 123-131
• Hrnčiar, Pavel; Haviar, Alfonz; Monoszová, Gabriela: Some characteristics of the edge distance between graphs. (English). Czechoslovak Mathematical Journal, vol. 46 (1996), issue 4, pp. 665-675
• Zelinka, Bohdan: Median properties of graphs with small diameters. (English). Mathematica Bohemica, vol. 120 (1995), issue 3, pp. 319-323
• Gliviak, Ferdinand; Kyš, Peter: Note on the relation between radius and diameter of a graph. (English). Mathematica Bohemica, vol. 120 (1995), issue 2, pp. 203-207
• Gliviak, Ferdinand; Knor, Martin: On radially extremal digraphs. (English). Mathematica Bohemica, vol. 120 (1995), issue 1, pp. 41-55
• Gutman, Ivan; Yeh, Yeong-Nan: The sum of all distances in bipartite graphs. (English). Mathematica Slovaca, vol. 45 (1995), issue 4, pp. 327-334
• Gliviak, Ferdinand; Knor, Martin; Šoltés, Ľubomír: Two-radially maximal graphs with special centers. (English). Mathematica Slovaca, vol. 45 (1995), issue 3, pp. 227-233
• Nebeský, Ladislav: Visibilities and sets of shortest paths in a connected graph. (English). Czechoslovak Mathematical Journal, vol. 45 (1995), issue 3, pp. 563-570
• Nebeský, Ladislav: A characterization of the interval function of a connected graph. (English). Czechoslovak Mathematical Journal, vol. 44 (1994), issue 1, pp. 173-178
• Nebeský, Ladislav: A characterization of the set of all shortest paths in a connected graph. (English). Mathematica Bohemica, vol. 119 (1994), issue 1, pp. 15-20
• Nebeský, Ladislav: Route systems of a connected graph. (English). Mathematica Bohemica, vol. 119 (1994), issue 4, pp. 407-414
• Knor, Martin; Niepel, Ľudovít; Šoltés, Ľubomír: Centers in line graphs. (English). Mathematica Slovaca, vol. 43 (1993), issue 1, pp. 11-20
• Zelinka, Bohdan: Distances between partially ordered sets. (English). Mathematica Bohemica, vol. 118 (1993), issue 2, pp. 167-170
• Zelinka, Bohdan: Edge shift distance between trees. (English). Archivum Mathematicum, vol. 28 (1992), issue 1, pp. 5-9
• Šabo, Michal: On a maximal distance between graphs. (English). Czechoslovak Mathematical Journal, vol. 41 (1991), issue 2, pp. 265-268
• Chartrand, Gary; Tian, Song Lin: Oriented graphs with prescribed $m$-center and $m$-median. (English). Czechoslovak Mathematical Journal, vol. 41 (1991), issue 4, pp. 716-723
• Šoltés, Ľubomír: Transmission in graphs: A bound and vertex removing. (English). Mathematica Slovaca, vol. 41 (1991), issue 1, pp. 11-16
• Zelinka, Bohdan: Contraction distance between isomorphism classes of graphs. (English). Časopis pro pěstování matematiky, vol. 115 (1990), issue 2, pp. 211-216
• Mollard, Michel: A family of nonregular distance monotone graphs. (English). Czechoslovak Mathematical Journal, vol. 40 (1990), issue 3, pp. 539-542
• Nebeský, Ladislav: Median graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 12 (1971), issue 2, pp. 317-325