{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T07:57:45Z","timestamp":1648713465861},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p> Two edges [Formula: see text] and [Formula: see text] in a graph [Formula: see text] are said to be adjacent if they have a vertex in common, and distance two apart if they are nonadjacent but both are adjacent to a common edge. An [Formula: see text]-edge-labeling of a graph [Formula: see text] is an assignment of nonnegative integers, called labels, to the edges of [Formula: see text] such that the difference between labels of any two adjacent edges is at least [Formula: see text], and the labels of any two edges that are distance two apart are different. The span of an [Formula: see text]-edge-labeling of a graph [Formula: see text] is the difference between the maximum and minimum labels. The minimum span over all [Formula: see text]-edge-labelings of a graph [Formula: see text] is called the [Formula: see text]-edge-labeling number of [Formula: see text], denoted by [Formula: see text]. For [Formula: see text], the edge-path-replacement of a graph [Formula: see text], denoted by [Formula: see text], is a graph obtained by replacing each edge of [Formula: see text] with a path [Formula: see text] on [Formula: see text] vertices. This paper investigates the [Formula: see text]-edge-labeling number of the edge-path-replacement [Formula: see text] of a graph [Formula: see text] for [Formula: see text]. We get the following main results: [Formula: see text] Let [Formula: see text] be a graph with maximum degree [Formula: see text] and [Formula: see text] be an integer not less than [Formula: see text], then [Formula: see text] if [Formula: see text] is odd, and otherwise [Formula: see text]. [Formula: see text] Let [Formula: see text] be a graph with maximum degree [Formula: see text]. Then [Formula: see text] when [Formula: see text] is even, and [Formula: see text] when [Formula: see text] is odd. <\/jats:p>","DOI":"10.1142\/s0129054118500041","type":"journal-article","created":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T02:20:23Z","timestamp":1521512423000},"page":"91-100","source":"Crossref","is-referenced-by-count":0,"title":["L(2,1)-Edge-Labelings of the Edge-Path-Replacement of a Graph"],"prefix":"10.1142","volume":"29","author":[{"given":"Nianfeng","family":"Lin","sequence":"first","affiliation":[{"name":"School of Science, Nantong University, Nantong, Jiangsu 226001, P. R. China"}]},{"given":"Damei","family":"L\u00fc","sequence":"additional","affiliation":[{"name":"School of Science, Nantong University, Nantong, Jiangsu 226001, P. R. China"}]},{"given":"Jinhua","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Science, Nantong University, Nantong, Jiangsu 226001, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2018,3,19]]},"reference":[{"key":"S0129054118500041BIB001","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxr037"},{"key":"S0129054118500041BIB002","doi-asserted-by":"publisher","DOI":"10.1142\/S012905411550029X"},{"key":"S0129054118500041BIB003","first-page":"161","volume":"106","author":"Chen Q.","year":"2012","journal-title":"Ars Combinatoria"},{"key":"S0129054118500041BIB004","first-page":"109","volume":"70","author":"Georges J. P.","year":"2004","journal-title":"Ars Combinatoria"},{"key":"S0129054118500041BIB005","doi-asserted-by":"publisher","DOI":"10.1137\/0405048"},{"key":"S0129054118500041BIB006","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1980.11899"},{"key":"S0129054118500041BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-013-9632-x"},{"key":"S0129054118500041BIB008","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-012-9508-5"},{"key":"S0129054118500041BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-012-9487-6"},{"key":"S0129054118500041BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-012-9487-6"},{"key":"S0129054118500041BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392606"},{"key":"S0129054118500041BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.11.029"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054118500041","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:00:54Z","timestamp":1565092854000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054118500041"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":12,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2018,3,19]]},"published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1142\/S0129054118500041"],"URL":"https:\/\/doi.org\/10.1142\/s0129054118500041","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}