{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:11:58Z","timestamp":1759032718545},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2014,3]]},"abstract":"<jats:p> The diameter of a graph can be affected by the addition or deletion of edges. In this paper, we examine the Cartesian product of graphs whose diameter increases (decreases) by the deletion (addition) of a single edge. The problems of minimality and maximality of the Cartesian product of graphs with respect to its diameter are also solved. These problems are motivated by the fact that most of the interconnection networks are graph products and a good network must be hard to disrupt and the transmissions must remain connected even if some vertices or edges fail. <\/jats:p>","DOI":"10.1142\/s1793830914500013","type":"journal-article","created":{"date-parts":[[2013,10,30]],"date-time":"2013-10-30T20:59:09Z","timestamp":1383166749000},"page":"1450001","source":"Crossref","is-referenced-by-count":4,"title":["THE DIAMETER VARIABILITY OF THE CARTESIAN PRODUCT OF GRAPHS"],"prefix":"10.1142","volume":"06","author":[{"given":"M. R.","family":"CHITHRA","sequence":"first","affiliation":[{"name":"Department of Mathematics, Cochin University of Science and Technology, Cochin-682022, India"}]},{"given":"A.","family":"VIJAYAKUMAR","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Cochin University of Science and Technology, Cochin-682022, India"}]}],"member":"219","published-online":{"date-parts":[[2014,2,18]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(95)00023-K"},{"key":"rf2","volume-title":"Distance in Graphs","author":"Buckley F.","year":"1990"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190080408"},{"key":"rf4","first-page":"265","volume":"38","author":"Graham N.","journal-title":"Discrete Appl. Math."},{"key":"rf5","volume-title":"Graph Theory and Interconnection Networks","author":"Hsu L. H.","year":"2009"},{"key":"rf6","doi-asserted-by":"crossref","DOI":"10.1201\/b10613","volume-title":"Topics in Graph Theory: Graphs and Their Cartesian Product","author":"Imrich W.","year":"2008"},{"key":"rf7","volume-title":"Handbook of Product Graphs","author":"Imrich W.","year":"2011"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(87)90085-X"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.03.008"},{"key":"rf10","volume-title":"Introduction to Graph Theory","author":"West D. B.","year":"2003"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830914500013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T13:59:14Z","timestamp":1565099954000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830914500013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,18]]},"references-count":10,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2014,2,18]]},"published-print":{"date-parts":[[2014,3]]}},"alternative-id":["10.1142\/S1793830914500013"],"URL":"https:\/\/doi.org\/10.1142\/s1793830914500013","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,18]]}}}