{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:10:57Z","timestamp":1737090657258,"version":"3.33.0"},"reference-count":15,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":4819,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1993,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we introduce a construction that produces graphs, called<jats:italic>E<\/jats:italic>\u2010graphs, by replacing the edges in a core graph with a copy of a given graph. These graphs are generalizations of several graphs that have recently been presented as models for network designs, including the<jats:italic>G<\/jats:italic>\u2010network and its extensions. We discuss several invariant properties of these graphs with emphasis on those of interest in network design, such as number of edges, diameter, and domination number. \u00a9<jats:italic>1993 by John Wiley &amp; Sons, Inc.<\/jats:italic><\/jats:p>","DOI":"10.1002\/net.3230230504","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T15:17:21Z","timestamp":1178983041000},"page":"473-479","source":"Crossref","is-referenced-by-count":4,"title":["Applications of E\u2010graphs in network design"],"prefix":"10.1002","volume":"23","author":[{"given":"Teresa W.","family":"Haynes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linda M.","family":"Lawson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676983"},{"key":"e_1_2_1_3_2","unstructured":"D. P.AgrawalandV. K.Janakiram Evaluating the performance of microcomputer configurations.Computer(1986)23\u201337."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230150108"},{"key":"e_1_2_1_5_2","first-page":"111","article-title":"A survey of interconnection networks","volume":"14","author":"Feng T. Y.","year":"1981","journal-title":"Computer"},{"key":"e_1_2_1_6_2","first-page":"57","article-title":"Changing and unchanging of the domination number of a graph","volume":"9","author":"Carrington J.","year":"1991","journal-title":"J. Combinatorial Math. Combinatorial Comput."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(88)90058-3"},{"journal-title":"J. Sankhya","article-title":"Some remarks on k\u2010insensitive graphs in network system design","author":"Guha R. K.","key":"e_1_2_1_8_2"},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","unstructured":"F.Harary Graph Theory. Addison\u2010Wesley Reading MA (1969).","DOI":"10.21236\/AD0705364"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207169008803799"},{"journal-title":"Discrete Appl. Math.","article-title":"Extremal graphs domination insensitive to the removal of k edges","author":"Haynes T. W.","key":"e_1_2_1_11_2"},{"key":"e_1_2_1_12_2","doi-asserted-by":"crossref","unstructured":"T. H.Rice andR. K.Guha A multilayered G\u2010network for massively parallel computation.Frontiers 88: The IEEE Proceedings of the 2nd Symposium on the Frontiers of Massively Parallel Computation(1989)519\u2013520.","DOI":"10.1109\/FMPC.1988.47490"},{"key":"e_1_2_1_13_2","first-page":"76","article-title":"The Gg \u2010network: A new linear\u2010cost computer network","volume":"74","author":"Sarkar D.","year":"1990","journal-title":"Congress. Number."},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(83)90007-2"},{"key":"e_1_2_1_15_2","first-page":"70","article-title":"Domination critical graphs","volume":"2","author":"Walikar H. B.","year":"1979","journal-title":"Natl. Acad. Sci. Lett."},{"key":"e_1_2_1_16_2","doi-asserted-by":"crossref","unstructured":"J.WuandE. B.Fernandez. Fault\u2010tolerant multiprocessor networks through an extended G\u2010network. Proceedings of Parabase\u201090 International Conference on Databases Parallel Architectures and Their Applications(N. Rishe S. Navathe and D. Tal Eds.) (1990) 216\u2013220.","DOI":"10.1109\/PARBSE.1990.77143"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230230504","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230230504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T05:54:11Z","timestamp":1737006851000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230230504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["10.1002\/net.3230230504"],"URL":"https:\/\/doi.org\/10.1002\/net.3230230504","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"type":"print","value":"0028-3045"},{"type":"electronic","value":"1097-0037"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}