Shokuhifar, Fatemeh; Hashemi, Ebrahim; Alhevaz, Abdollah An alternative perspective of near-rings of polynomials and power series. (English) Zbl 07603190 Kyungpook Math. J. 62, No. 3, 437-453 (2022). Reviewer: Kuncham Syam Prasad (Manipal) MSC: 16Y30 05C12 PDF BibTeX XML Cite \textit{F. Shokuhifar} et al., Kyungpook Math. J. 62, No. 3, 437--453 (2022; Zbl 07603190) Full Text: DOI OpenURL
Sumalroj, Supalak; Worawannotai, Chalermpong The nonexistence of a distance-regular graph with intersection array \(\{75,64,22,1;1,2,64,75\}\). (English) Zbl 1492.05037 Australas. J. Comb. 82, Part 1, 115-118 (2022). Reviewer: Mirko Lepović (Kragujevac) MSC: 05C12 05E30 PDF BibTeX XML Cite \textit{S. Sumalroj} and \textit{C. Worawannotai}, Australas. J. Comb. 82, Part 1, 115--118 (2022; Zbl 1492.05037) Full Text: Link OpenURL
Rouzbahani Malayeri, M.; Saeedi Madani, S.; Kiani, D. On the depth of binomial edge ideals of graphs. (English) Zbl 07526627 J. Algebr. Comb. 55, No. 3, 827-846 (2022). MSC: 13C15 05E40 13C70 13C05 PDF BibTeX XML Cite \textit{M. Rouzbahani Malayeri} et al., J. Algebr. Comb. 55, No. 3, 827--846 (2022; Zbl 07526627) Full Text: DOI arXiv OpenURL
Li, He; Zhang, Shumin; Zhu, Bo; Ye, Chengfu Steiner 4-diameter, maximum degree and size of a graph. (English) Zbl 1492.05036 Discontin. Nonlinearity Complex. 10, No. 3, 571-584 (2021). MSC: 05C12 05C07 05C35 PDF BibTeX XML Cite \textit{H. Li} et al., Discontin. Nonlinearity Complex. 10, No. 3, 571--584 (2021; Zbl 1492.05036) Full Text: DOI OpenURL
Zaman, Shahid; Abolaban, Fouad A.; Ahmad, Ali; Asim, Muhammad Ahsan Maximum \(H\)-index of bipartite network with some given parameters. (English) Zbl 1484.05054 AIMS Math. 6, No. 5, 5165-5175 (2021). MSC: 05C09 05C92 PDF BibTeX XML Cite \textit{S. Zaman} et al., AIMS Math. 6, No. 5, 5165--5175 (2021; Zbl 1484.05054) Full Text: DOI OpenURL
Guest, Kelly; Johnson, Andrew; Johnson, Peter; Jones, William; Takahashi, Yuki; Zhang, Zhichun (Joy) Graphs with prescribed radius, diameter, and center. (English) Zbl 1469.05051 Int. J. Math. Comput. Sci. 16, No. 4, 1479-1486 (2021). MSC: 05C12 PDF BibTeX XML Cite \textit{K. Guest} et al., Int. J. Math. Comput. Sci. 16, No. 4, 1479--1486 (2021; Zbl 1469.05051) Full Text: arXiv Link OpenURL
Dorough, Stephanie; Johnson, Peter Rainbow connectivity and proper rainbow connectivity of \(\theta(1,s,t)\). (English) Zbl 1469.05055 Int. J. Math. Comput. Sci. 16, No. 4, 1261-1277 (2021). MSC: 05C15 05C38 PDF BibTeX XML Cite \textit{S. Dorough} and \textit{P. Johnson}, Int. J. Math. Comput. Sci. 16, No. 4, 1261--1277 (2021; Zbl 1469.05055) Full Text: Link OpenURL
Capalbo, Michael An explicit infinite family of \(\mathbb{M}\)-vertex graphs with maximum degree \(K\) and diameter \([1+o(1)]\log_{K-1}\mathbb{M}\) for each \(K-1\) a prime power. (English) Zbl 1488.05426 Combinatorica 41, No. 3, 353-378 (2021). Reviewer: Mirko Lepović (Kragujevac) MSC: 05C75 05C35 05C12 05C07 05C25 PDF BibTeX XML Cite \textit{M. Capalbo}, Combinatorica 41, No. 3, 353--378 (2021; Zbl 1488.05426) Full Text: DOI OpenURL
Saiago, Carlos M. Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments. (English) Zbl 1433.15014 Spec. Matrices 7, 316-326 (2019). MSC: 15A18 05C05 05C50 PDF BibTeX XML Cite \textit{C. M. Saiago}, Spec. Matrices 7, 316--326 (2019; Zbl 1433.15014) Full Text: DOI OpenURL
Malaravan, A. Chellaram; Baskar, A. Wilson A note on graph and its complement with specified properties: radius, diameter, center, and periphery. (English) Zbl 1410.05054 Discrete Math. Algorithms Appl. 11, No. 2, Article ID 1950021, 9 p. (2019). MSC: 05C12 PDF BibTeX XML Cite \textit{A. C. Malaravan} and \textit{A. W. Baskar}, Discrete Math. Algorithms Appl. 11, No. 2, Article ID 1950021, 9 p. (2019; Zbl 1410.05054) Full Text: DOI OpenURL
Padmapriya, P.; Mathad, Veena Bounds for the first Zagreb eccentricity index and first Zagreb degree eccentricity index. (English) Zbl 1434.05040 Kyungpook Math. J. 58, No. 2, 221-229 (2018). MSC: 05C09 05C10 05C12 05C07 PDF BibTeX XML Cite \textit{P. Padmapriya} and \textit{V. Mathad}, Kyungpook Math. J. 58, No. 2, 221--229 (2018; Zbl 1434.05040) Full Text: DOI OpenURL
Mehdi-Nezhad, Elham; Rahimi, Amir M. The Smarandache vertices of the comaximal graph of a commutative ring. (English) Zbl 1418.05074 Lib. Math. (N.S.) 38, No. 1, 69-82 (2018). MSC: 05C25 13A15 13A99 PDF BibTeX XML Cite \textit{E. Mehdi-Nezhad} and \textit{A. M. Rahimi}, Lib. Math. (N.S.) 38, No. 1, 69--82 (2018; Zbl 1418.05074) OpenURL
Badaoui, Mohamad; Bretto, Alain; Ellison, David; Mourad, Bassam On constructing expander families of \(G\)-graphs. (English) Zbl 1411.05145 Ars Math. Contemp. 15, No. 2, 425-440 (2018). MSC: 05C40 05C42 05C69 PDF BibTeX XML Cite \textit{M. Badaoui} et al., Ars Math. Contemp. 15, No. 2, 425--440 (2018; Zbl 1411.05145) Full Text: DOI OpenURL
Visweswaran, S.; Parejiya, Jaydeep Some results on the complement of the comaximal ideal graphs of commutative rings. (English) Zbl 1402.13004 Ric. Mat. 67, No. 2, 709-728 (2018). Reviewer: T. Tamizh Chelvam (Tamilnadu) MSC: 13A15 05C25 PDF BibTeX XML Cite \textit{S. Visweswaran} and \textit{J. Parejiya}, Ric. Mat. 67, No. 2, 709--728 (2018; Zbl 1402.13004) Full Text: DOI OpenURL
Malyshev, Anton; Pak, Igor Lifts, derandomization, and diameters of Schreier graphs of Mealy automata. (English) Zbl 1413.05159 Combinatorica 37, No. 4, 733-765 (2017). Reviewer: Robert Jajcay (Terre Haute) MSC: 05C25 20F10 68Q70 05C75 05C76 68Q45 PDF BibTeX XML Cite \textit{A. Malyshev} and \textit{I. Pak}, Combinatorica 37, No. 4, 733--765 (2017; Zbl 1413.05159) Full Text: DOI arXiv OpenURL
Visweswaran, S.; Parmar, Anirudhdha Some results on the complement of a new graph associated to a commutative ring. (English) Zbl 1379.13002 Commun. Comb. Optim. 2, No. 2, 119-138 (2017). MSC: 13A15 05C25 PDF BibTeX XML Cite \textit{S. Visweswaran} and \textit{A. Parmar}, Commun. Comb. Optim. 2, No. 2, 119--138 (2017; Zbl 1379.13002) Full Text: DOI OpenURL
Khorsandi, Mahdi Reza; Shekofteh, Atefeh On the line graphs of zero-divisor graphs of posets. (English) Zbl 1365.05063 J. Algebra Appl. 16, No. 7, Article ID 1750121, 10 p. (2017). MSC: 05C10 05C76 06A07 06A11 PDF BibTeX XML Cite \textit{M. R. Khorsandi} and \textit{A. Shekofteh}, J. Algebra Appl. 16, No. 7, Article ID 1750121, 10 p. (2017; Zbl 1365.05063) Full Text: DOI OpenURL
Deckelnick, Klaus; Grunau, Hans-Christoph; Röger, Matthias Minimising a relaxed Willmore functional for graphs subject to boundary conditions. (English) Zbl 1368.49046 Interfaces Free Bound. 19, No. 1, 109-140 (2017). MSC: 49Q10 53C42 49J45 PDF BibTeX XML Cite \textit{K. Deckelnick} et al., Interfaces Free Bound. 19, No. 1, 109--140 (2017; Zbl 1368.49046) Full Text: DOI arXiv OpenURL
Alomari, Omar; Abudayah, Mohammad; Al-Ezeh, Hasan Graphs whose complement and cube are isomorphic. (English) Zbl 1335.05054 J. Comb. Math. Comb. Comput. 94, 261-271 (2015). MSC: 05C12 05C25 05C40 PDF BibTeX XML Cite \textit{O. Alomari} et al., J. Comb. Math. Comb. Comput. 94, 261--271 (2015; Zbl 1335.05054) OpenURL
Krot, A. V. On threshold probabilities for the realization of a random graph by a geometric graph. (English. Russian original) Zbl 1325.05150 Dokl. Math. 92, No. 1, 480-481 (2015); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 463, No. 5, 519-520 (2015). MSC: 05C80 05C10 05C12 05C62 PDF BibTeX XML Cite \textit{A. V. Krot}, Dokl. Math. 92, No. 1, 480--481 (2015; Zbl 1325.05150); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 463, No. 5, 519--520 (2015) Full Text: DOI OpenURL
Monakhova, È. A. A new attainable lower bound for the number of nodes in quadruple circulant networks. (Russian) Zbl 1324.05187 Diskretn. Anal. Issled. Oper. 20, No. 1, 37-44 (2013). MSC: 05C82 05C35 PDF BibTeX XML Cite \textit{È. A. Monakhova}, Diskretn. Anal. Issled. Oper. 20, No. 1, 37--44 (2013; Zbl 1324.05187) Full Text: MNR OpenURL
Ramane, Harishchandra S.; Gutman, Ivan; Ganagi, Asha B. On diameter of line graphs. (English) Zbl 1303.05054 Iran. J. Math. Sci. Inform. 8, No. 1, 105-109 (2013). MSC: 05C12 05C76 PDF BibTeX XML Cite \textit{H. S. Ramane} et al., Iran. J. Math. Sci. Inform. 8, No. 1, 105--109 (2013; Zbl 1303.05054) Full Text: Link OpenURL
Aslan, Ersin; Kirlangic, Alpay Lexicographic product and isoperimetric number. (English) Zbl 1288.05132 ISRN Comb. 2013, Article ID 243981, 6 p. (2013). MSC: 05C35 05C76 PDF BibTeX XML Cite \textit{E. Aslan} and \textit{A. Kirlangic}, ISRN Comb. 2013, Article ID 243981, 6 p. (2013; Zbl 1288.05132) Full Text: DOI OpenURL
Marklof, Jens; Strömbergsson, Andreas Diameters of random circulant graphs. (English) Zbl 1340.05063 Combinatorica 33, No. 4, 429-466 (2013). Reviewer: Ismail Naci Cangül (Bursa) MSC: 05C12 05C80 11H31 37A17 90B10 PDF BibTeX XML Cite \textit{J. Marklof} and \textit{A. Strömbergsson}, Combinatorica 33, No. 4, 429--466 (2013; Zbl 1340.05063) Full Text: DOI arXiv OpenURL
Asir, T.; Chelvam, T. Tamizh On the total graph and its complement of a commutative ring. (English) Zbl 1272.05074 Commun. Algebra 41, No. 10, 3820-3835 (2013). MSC: 05C25 05C75 05C45 13A15 13A99 13M05 16P10 PDF BibTeX XML Cite \textit{T. Asir} and \textit{T. T. Chelvam}, Commun. Algebra 41, No. 10, 3820--3835 (2013; Zbl 1272.05074) Full Text: DOI OpenURL
Koreneva, A. M.; Fomichev, V. M. About a Feistel block cipher generalization. (Russian. English summary) Zbl 1492.94134 Prikl. Diskretn. Mat. 2012, No. 3(17), 34-40 (2012). MSC: 94A60 PDF BibTeX XML Cite \textit{A. M. Koreneva} and \textit{V. M. Fomichev}, Prikl. Diskretn. Mat. 2012, No. 3(17), 34--40 (2012; Zbl 1492.94134) Full Text: MNR OpenURL
Xu, Jinquan; Li, Ping; Lai, Hong-Jian The connectivity and diameter of second order circuit graphs of matroids. (English) Zbl 1256.05048 Graphs Comb. 28, No. 5, 737-742 (2012). MSC: 05B35 05C40 05C38 05C12 PDF BibTeX XML Cite \textit{J. Xu} et al., Graphs Comb. 28, No. 5, 737--742 (2012; Zbl 1256.05048) Full Text: DOI OpenURL
Edwards, Michelle; MacGillivray, Gary The diameter of total domination and independent domination vertex-critical graphs. (English) Zbl 1251.05124 Australas. J. Comb. 52, 33-39 (2012). MSC: 05C69 05C12 PDF BibTeX XML Cite \textit{M. Edwards} and \textit{G. MacGillivray}, Australas. J. Comb. 52, 33--39 (2012; Zbl 1251.05124) OpenURL
Xu, Kexiang The smallest Hosoya index of unicyclic graphs with given diameter. (English) Zbl 1247.05250 Math. Commun. 17, No. 1, 221-239 (2012). MSC: 05C90 05C12 05C70 05C35 PDF BibTeX XML Cite \textit{K. Xu}, Math. Commun. 17, No. 1, 221--239 (2012; Zbl 1247.05250) Full Text: Link OpenURL
Kathiresan, Kumarappan; Arockiaraj, S. \(p\)-Wiener intervals and \(p\)-Wiener free intervals. (English) Zbl 1255.05061 Discuss. Math., Graph Theory 32, No. 1, 121-127 (2012). MSC: 05C12 PDF BibTeX XML Cite \textit{K. Kathiresan} and \textit{S. Arockiaraj}, Discuss. Math., Graph Theory 32, No. 1, 121--127 (2012; Zbl 1255.05061) Full Text: DOI OpenURL
Ghanem, Manal; Nazzal, Khalida On the line graph of the complement graph for the ring of Gaussian integers modulo \(n\). (English) Zbl 1242.05155 Open J. Discrete Math. 2, No. 1, 24-34 (2012). MSC: 05C45 05C12 PDF BibTeX XML Cite \textit{M. Ghanem} and \textit{K. Nazzal}, Open J. Discrete Math. 2, No. 1, 24--34 (2012; Zbl 1242.05155) Full Text: DOI OpenURL
Alizadeh, M.; Das, A. K.; Maimani, H. R.; Pournaki, M. R.; Yassemi, S. On the diameter and girth of zero-divisor graphs of posets. (English) Zbl 1239.05088 Discrete Appl. Math. 160, No. 9, 1319-1324 (2012). MSC: 05C25 05C12 06A07 PDF BibTeX XML Cite \textit{M. Alizadeh} et al., Discrete Appl. Math. 160, No. 9, 1319--1324 (2012; Zbl 1239.05088) Full Text: DOI OpenURL
Indu, R. S.; John, L. Principal ideal graphs of unit regular monoids. (English) Zbl 1499.05278 Adv. Appl. Discrete Math. 7, No. 2, 145-151 (2011). MSC: 05C25 PDF BibTeX XML Cite \textit{R. S. Indu} and \textit{L. John}, Adv. Appl. Discrete Math. 7, No. 2, 145--151 (2011; Zbl 1499.05278) Full Text: Link OpenURL
Das, Kinkar Ch. Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph. (English) Zbl 1238.05159 Discrete Math. 311, No. 22, 2593-2600 (2011). MSC: 05C50 05C12 15A42 15A18 PDF BibTeX XML Cite \textit{K. Ch. Das}, Discrete Math. 311, No. 22, 2593--2600 (2011; Zbl 1238.05159) Full Text: DOI OpenURL
Monakhova, Eh. A. On an extremal family of circulant networks. (Russian) Zbl 1249.90031 Diskretn. Anal. Issled. Oper. 18, No. 1, 77-84 (2011). MSC: 90B10 PDF BibTeX XML Cite \textit{Eh. A. Monakhova}, Diskretn. Anal. Issled. Oper. 18, No. 1, 77--84 (2011; Zbl 1249.90031) OpenURL
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine On the sizes of graphs and their powers: the undirected case. (English) Zbl 1228.05247 Discrete Appl. Math. 159, No. 16, 1666-1675 (2011). MSC: 05C76 05C12 PDF BibTeX XML Cite \textit{D. Auger} et al., Discrete Appl. Math. 159, No. 16, 1666--1675 (2011; Zbl 1228.05247) Full Text: DOI OpenURL
Monakhova, Eh. A. Multiplicative circulant networks. (Russian) Zbl 1249.05360 Diskretn. Anal. Issled. Oper. 17, No. 5, 56-66 (2010). MSC: 05C82 PDF BibTeX XML Cite \textit{Eh. A. Monakhova}, Diskretn. Anal. Issled. Oper. 17, No. 5, 56--66 (2010; Zbl 1249.05360) OpenURL
Vetrík, Tomáš; Yulianti, Lyra; Baskoro, Edy Tri On Ramsey \((K_{1,2,}C_4)\)-minimal graphs. (English) Zbl 1217.05163 Discuss. Math., Graph Theory 30, No. 4, 637-649 (2010). MSC: 05C55 05D10 PDF BibTeX XML Cite \textit{T. Vetrík} et al., Discuss. Math., Graph Theory 30, No. 4, 637--649 (2010; Zbl 1217.05163) Full Text: DOI OpenURL
Hattingh, J. H.; Jonck, E.; Joubert, E. J. Bounds on the total restrained domination number of a graph. (English) Zbl 1231.05202 Graphs Comb. 26, No. 1, 77-93 (2010). MSC: 05C69 PDF BibTeX XML Cite \textit{J. H. Hattingh} et al., Graphs Comb. 26, No. 1, 77--93 (2010; Zbl 1231.05202) Full Text: DOI OpenURL
Fedoryaeva, T. I. Exact upper estimates of the number of different balls of a given radius in the graphs with a fixed number of vertices and a fixed diameter. (Russian) Zbl 1249.05092 Diskretn. Anal. Issled. Oper. 16, No. 6, 74-92 (2009). MSC: 05C12 05C35 PDF BibTeX XML Cite \textit{T. I. Fedoryaeva}, Diskretn. Anal. Issled. Oper. 16, No. 6, 74--92 (2009; Zbl 1249.05092) OpenURL
An, Xinhui; Wu, Baoyindureng The Wiener index of the \(k\)th power of a graph. (English) Zbl 1138.05321 Appl. Math. Lett. 21, No. 5, 436-440 (2008). MSC: 05C75 05C12 PDF BibTeX XML Cite \textit{X. An} and \textit{B. Wu}, Appl. Math. Lett. 21, No. 5, 436--440 (2008; Zbl 1138.05321) Full Text: DOI OpenURL
Maimani, Hamid Reza; Yassemi, Siamak Zero-divisor graphs of amalgamated duplication of a ring along an ideal. (English) Zbl 1149.13001 J. Pure Appl. Algebra 212, No. 1, 168-174 (2008). Reviewer: Cameron Wickham (Springfield) MSC: 13A15 05C75 PDF BibTeX XML Cite \textit{H. R. Maimani} and \textit{S. Yassemi}, J. Pure Appl. Algebra 212, No. 1, 168--174 (2008; Zbl 1149.13001) Full Text: DOI arXiv OpenURL
Berman, Piotr; Kasiviswanathan, Shiva Prasad Faster approximation of distances in graphs. (English) Zbl 1209.05238 Dehne, Frank (ed.) et al., Algorithms and data structures. 10th international workshop, WADS 2007, Halifax, Canada, August 15–17, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73948-7/pbk). Lecture Notes in Computer Science 4619, 541-552 (2007). MSC: 05C85 05C12 05C22 05C35 68Q25 68W25 PDF BibTeX XML Cite \textit{P. Berman} and \textit{S. P. Kasiviswanathan}, Lect. Notes Comput. Sci. 4619, 541--552 (2007; Zbl 1209.05238) Full Text: DOI OpenURL
Protasova, K. D. Balanced graph partitions. (English. Russian original) Zbl 1133.05077 Math. Notes 79, No. 1, 116-121 (2006); translation from Mat. Zametki 79, No. 1, 127-133 (2006). MSC: 05C70 05C12 05C15 PDF BibTeX XML Cite \textit{K. D. Protasova}, Math. Notes 79, No. 1, 116--121 (2006; Zbl 1133.05077); translation from Mat. Zametki 79, No. 1, 127--133 (2006) Full Text: DOI OpenURL
Fedoryaeva, T. I. Variety of balls in metric spaces of trees. (Russian) Zbl 1249.05090 Diskretn. Anal. Issled. Oper., Ser. 1 12, No. 3, 74-84 (2005). MSC: 05C12 05C05 PDF BibTeX XML Cite \textit{T. I. Fedoryaeva}, Diskretn. Anal. Issled. Oper., Ser. 1 12, No. 3, 74--84 (2005; Zbl 1249.05090) OpenURL
Liaw, Sheng-Chyang; Chang, Gerard J. Generalized diameters and Rabin numbers of networks. (English) Zbl 0924.90128 J. Comb. Optim. 2, No. 4, 371-384 (1999). Reviewer: I.Althöfer (Jena) MSC: 90C35 90B25 PDF BibTeX XML Cite \textit{S.-C. Liaw} and \textit{G. J. Chang}, J. Comb. Optim. 2, No. 4, 371--384 (1999; Zbl 0924.90128) Full Text: DOI OpenURL
Corneil, Derek G.; Dragan, Feodor F.; Habib, Michel; Paul, Christophe Diameter determination on restricted graph families. (English) Zbl 0928.68087 Hromkovič, Juraj (ed.) et al., Graph-theoretic concepts in computer science. 24th international workshop, WG ’98, Smolenice Castle, Slovak Republic, June 18–20, 1998. Proceecdings. Berlin: Springer. Lect. Notes Comput. Sci. 1517, 192-202 (1998). MSC: 68R10 05C12 PDF BibTeX XML Cite \textit{D. G. Corneil} et al., Lect. Notes Comput. Sci. 1517, 192--202 (1998; Zbl 0928.68087) OpenURL
van Dam, Edwin R. Graphs, distances and eigenvalues. (English) Zbl 0880.90129 Klein Haneveld, W. K. (ed.) et al., Ten years LNMB. Ph.D. research and graduate courses of the Dutch network of operations research. Amsterdam: CWI. CWI Tracts. 122, 19-22 (1997). MSC: 90C35 PDF BibTeX XML Cite \textit{E. R. van Dam}, in: Ten years LNMB. Ph.D. research and graduate courses of the Dutch network of operations research. Amsterdam: CWI. 19--22 (1997; Zbl 0880.90129) OpenURL
Ishigami, Yoshiyasu The wide-diameter of the \(n\)-dimensional toroidal mesh. (English) Zbl 0865.90052 Networks 27, No. 4, 257-266 (1996). MSC: 90B18 PDF BibTeX XML Cite \textit{Y. Ishigami}, Networks 27, No. 4, 257--266 (1996; Zbl 0865.90052) Full Text: DOI OpenURL
Palacios, José Luis A bound for the covering time of random walks on graphs. (English) Zbl 0754.60078 Stat. Probab. Lett. 14, No. 1, 9-11 (1992). MSC: 60G50 05C80 PDF BibTeX XML Cite \textit{J. L. Palacios}, Stat. Probab. Lett. 14, No. 1, 9--11 (1992; Zbl 0754.60078) Full Text: DOI OpenURL
Ghosh, Subir Kumar; Maheshwari, Anil An optimal parallel algorithm for computing furthest neighbors in a tree. (English) Zbl 0759.68026 Inf. Process. Lett. 44, No. 3, 155-160 (1992). MSC: 68W15 68R10 68Q25 PDF BibTeX XML Cite \textit{S. K. Ghosh} and \textit{A. Maheshwari}, Inf. Process. Lett. 44, No. 3, 155--160 (1992; Zbl 0759.68026) Full Text: DOI OpenURL
Chartrand, Gary; Johns, G.; Oellermann, Ortrud R. On peripheral vertices in graphs. (English) Zbl 0702.05049 Topics in combinatorics and graph theory. Essays in honour of Gerhard Ringel, 193-199 (1990). MSC: 05C38 05C35 PDF BibTeX XML OpenURL
Flajolet, Philippe; Odlyzko, Andrew M. Random mapping statistics. (English) Zbl 0747.05006 Advances in cryptology - EUROCRYPT ’89, Proc. Workshop, Houthalen/Belg. 1989, Lect. Notes Comput. Sci. 434, 329-354 (1990). MSC: 05A15 60C05 05C35 PDF BibTeX XML Cite \textit{P. Flajolet} and \textit{A. M. Odlyzko}, Lect. Notes Comput. Sci. 434, 329--354 (1990; Zbl 0747.05006) OpenURL
Mohar, Bojan Isoperimetric numbers of graphs. (English) Zbl 0719.05042 J. Comb. Theory, Ser. B 47, No. 3, 274-291 (1989). MSC: 05C35 PDF BibTeX XML Cite \textit{B. Mohar}, J. Comb. Theory, Ser. B 47, No. 3, 274--291 (1989; Zbl 0719.05042) Full Text: DOI OpenURL
Buckley, Fred; Lewinter, Martin A note on graphs with diameter-preserving spanning trees. (English) Zbl 0658.05021 J. Graph Theory 12, No. 4, 525-528 (1988). Reviewer: S.F.Kapoor MSC: 05C05 05C38 PDF BibTeX XML Cite \textit{F. Buckley} and \textit{M. Lewinter}, J. Graph Theory 12, No. 4, 525--528 (1988; Zbl 0658.05021) Full Text: DOI OpenURL
Chung, Fan R. K. Diameters of graphs: Old problems and new results. (English) Zbl 0695.05029 Combinatorics, graph theory, and computing, Proc. 18th Southeast. Conf., Boca Raton/Fl. 1987, Congr. Numerantium 60, 295-317 (1987). Reviewer: G.Chartrand MSC: 05C38 05-02 05-04 PDF BibTeX XML OpenURL
Usami, Yoko Extremal graphs of diameter at most 6 after deleting any vertex. (English) Zbl 0577.05040 J. Graph Theory 9, No. 2, 221-234 (1985). Reviewer: G.Schmidt MSC: 05C35 05C38 PDF BibTeX XML Cite \textit{Y. Usami}, J. Graph Theory 9, No. 2, 221--234 (1985; Zbl 0577.05040) Full Text: DOI OpenURL
Hedetniemi, Sandra M.; Hedetniemi, Stephen T. Reducing space and time requirements for processing trees. (English) Zbl 0549.68061 Combinatorics, graph theory and computing, Proc. 14th Southeast. Conf., Boca Raton/Flo. 1983, Congr. Numerantium 40, 3-22 (1983). MSC: 68R10 68Q25 68W99 PDF BibTeX XML OpenURL
Koska, Anna On partition graphs. (English) Zbl 0545.05056 Discuss. Math. 6, 59-64 (1983). Reviewer: H.Kramer MSC: 05C99 05C40 PDF BibTeX XML Cite \textit{A. Koska}, Discuss. Math. 6, 59--64 (1983; Zbl 0545.05056) OpenURL
Tarnai, T.; Gáspár, Zs. Rigidity of the graphs of the spherical circle packings. (English) Zbl 0536.05013 Z. Angew. Math. Mech. 63, No. 5, 333-334 (1983). Reviewer: B.Burrows MSC: 05B40 52C17 05C99 PDF BibTeX XML Cite \textit{T. Tarnai} and \textit{Zs. Gáspár}, Z. Angew. Math. Mech. 63, 333--334 (1983; Zbl 0536.05013) OpenURL
Chen, Chih-Kang Eric; Garfinkel, R. S. The generalized diameter of a graph. (English) Zbl 0508.90034 Networks 12, 335-340 (1982). MSC: 90B05 05C35 05C38 PDF BibTeX XML Cite \textit{C.-K. E. Chen} and \textit{R. S. Garfinkel}, Networks 12, 335--340 (1982; Zbl 0508.90034) Full Text: DOI OpenURL
Laskar, Renu; Shier, D. On chordal graphs. (English) Zbl 0453.05053 Combinatorics, graph theory and computing, Proc. 11th southeast. Conf., Boca Raton/Florida 1980, Vol. II, Congr. Numerantium 29, 579-588 (1980). MSC: 05C75 PDF BibTeX XML OpenURL