{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T16:54:55Z","timestamp":1700672095809},"reference-count":20,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":6152,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1989,12]]},"abstract":"Abstract<\/jats:title>This paper introduces a new parameter I<\/jats:italic> = I(G)<\/jats:italic> for a loopless digraph G<\/jats:italic>, which can be thought of as a generalization of the girth of a graph. Let k<\/jats:italic>, \u03bb, \u03b4, and D<\/jats:italic> denote respectively the connectivity, arc\u2010connectivity, minimum degree, and diameter of G.<\/jats:italic> Then it is proved that \u03bb = \u03b4 if D<\/jats:italic> \u2a7d 2I<\/jats:italic> and \u03ba k<\/jats:italic> = \u03b4 if D<\/jats:italic> \u2a7d 2I<\/jats:italic> \u2010 1. Analogous results involving upper bounds for k<\/jats:italic> and \u03bb are given for the more general class of digraphs with loops. Sufficient conditions for a digraph to be super\u2010\u03bb and super\u2010k<\/jats:italic> are also given. As a corollary, maximally connected and superconnected iterated line digraphs and (undirected) graphs are characterized.<\/jats:p>","DOI":"10.1002\/jgt.3190130603","type":"journal-article","created":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T19:49:49Z","timestamp":1181332189000},"page":"657-668","source":"Crossref","is-referenced-by-count":100,"title":["Maximally connected digraphs"],"prefix":"10.1002","volume":"13","author":[{"given":"J.","family":"F\u00e0brega","sequence":"first","affiliation":[]},{"given":"M. A.","family":"Fiol","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190100211"},{"key":"e_1_2_1_3_2","series-title":"London Mathematics Society Lecture Note Series 82","first-page":"1","volume-title":"Graphs and interconnection networks: Diameter and vulnerability","author":"Bermond J.\u2010C.","year":"1983"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(86)90008-0"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788663"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608704"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190080406"},{"key":"e_1_2_1_8_2","unstructured":"G.ChartrandandL.Lesniak Graphs and Digraphs. Wadsworth Monterrey (1986)."},{"key":"e_1_2_1_9_2","unstructured":"J.F\u00e0brega M. A.Fiol andJ. L. A.Yebra Connectivity and reliable routing algorithms in line digraphs.Proceedings of the III IAESTED International Symposium on Applied Informatics Grindelwald Switzerland (1985)45\u201350."},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676455"},{"key":"e_1_2_1_11_2","series-title":"Lecture Notes in Mathematics 186","first-page":"105","volume-title":"Connectivity in digraphs","author":"Geller D.","year":"1970"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/12.8718"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.1675809"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1983.1676323"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1985.1676569"},{"key":"e_1_2_1_16_2","first-page":"148","article-title":"Sur la connexite des graphes orientes","volume":"274","author":"Jolivet X.","year":"1972","journal-title":"C. R. Acad. Sci. Pairs"},{"key":"e_1_2_1_17_2","first-page":"71","article-title":"Critical graphs of given diameter","volume":"30","author":"Plesnik J.","year":"1975","journal-title":"Acta Fac. Rerum Natur. Univ. Comenian. Math."},{"key":"e_1_2_1_18_2","unstructured":"S. M.Reddy J. G.Kuhl S. H.Hosseini andH.Lee On digraphs with minimum diameter and maximum connectivity.Proceedings of the 20th Annual Allerton Conference(1982)1018\u20131026."},{"key":"e_1_2_1_19_2","unstructured":"S. M.Reddy D. K.Pradham andJ.Kuhl Directed graphs with minimum diameter and maximum connectivity. Technical report School of Engineering Oakland University Rochester MI (1980)."},{"key":"e_1_2_1_20_2","unstructured":"T.Soneoka H.Nakada andM.Imase Sufficient conditions for dense graphs to be maximally connected Proceedings of ISCAS85(1985)811\u2013814."},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(87)90151-8"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190130603","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190130603","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T02:57:24Z","timestamp":1697943444000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190130603"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["10.1002\/jgt.3190130603"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190130603","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}