{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T09:39:43Z","timestamp":1762249183511},"reference-count":7,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":8890,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1982,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Sharp lower bounds for the point connectivity and line connectivity of the line graph <jats:italic>L(G<\/jats:italic>) and the total graph <jats:italic>T(G<\/jats:italic>) of a graph <jats:italic>G<\/jats:italic> are determined. The lower bounds are expressed in terms of the point connectivity <jats:italic>k<\/jats:italic>, line connectivity \u03bb, and minimum degree \u03b4 of <jats:italic>G.<\/jats:italic> It is also shown that 2\u03bb is an upper bound for <jats:italic>k(T(G<\/jats:italic>)) and that \u03bb(<jats:italic>T(G<\/jats:italic>))= 2\u03b4 = \u03b4(<jats:italic>T(G<\/jats:italic>)). In each case the realizable values beyond the lower bound are determined.<\/jats:p>","DOI":"10.1002\/jgt.3190060214","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T06:55:16Z","timestamp":1180421716000},"page":"197-203","source":"Crossref","is-referenced-by-count":9,"title":["The connectivities of line and total graphs"],"prefix":"10.1002","volume":"6","author":[{"given":"Douglas","family":"Bauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralph","family":"Tindell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190030410"},{"key":"e_1_2_1_3_2","unstructured":"D.BauerandR.Tindell Bounds and realizable values for the connectivities of line and total graphs. Stevens Research Report PAM #8104. Stevens Institute of Technology Hoboken NJ 07030."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01350320"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01419429"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01419431"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01396460"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190060214","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190060214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T05:21:51Z","timestamp":1699766511000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190060214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,6]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,6]]}},"alternative-id":["10.1002\/jgt.3190060214"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190060214","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,6]]}}}