{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T05:47:38Z","timestamp":1723096058791},"reference-count":0,"publisher":"Combinatorial Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ars Comb."],"published-print":{"date-parts":[[2023,7,31]]},"abstract":"<jats:p>Let us consider a~simple connected undirected graph \\(G=(V,E)\\). For a~graph \\(G\\) we define a~\\(k\\)-labeling \\(\\phi: V(G)\\to \\{1,2, \\dots, k\\}\\) to be a~distance  irregular vertex \\(k\\)-labeling of the graph \\(G\\) if for every two different vertices \\(u\\) and \\(v\\) of \\(G\\), one has \\(wt(u) \\ne wt(v),\\) where the weight of a~vertex \\(u\\) in the labeling \\(\\phi\\) is \\(wt(u)=\\sum\\limits_{v\\in N(u)}\\phi(v),\\) where \\(N(u)\\) is the set of neighbors of \\(u\\).  The minimum \\(k\\) for which the graph \\(G\\) has a~distance irregular vertex \\(k\\)-labeling is known as distance irregularity strength of \\(G,\\) it is denoted as \\(dis(G)\\). In this paper, we determine the exact value of the distance irregularity strength of corona product of cycle and path with complete graph of order \\(1,\\) friendship graph, Jahangir graph and helm graph. For future research, we suggest some open problems for researchers of the same domain of study.<\/jats:p>","DOI":"10.61091\/ars156-04","type":"journal-article","created":{"date-parts":[[2023,7,28]],"date-time":"2023-07-28T14:31:51Z","timestamp":1690554711000},"page":"35-42","source":"Crossref","is-referenced-by-count":0,"title":["A Note on Distance Irregular Labeling of Graphs"],"prefix":"10.61091","volume":"156","author":[{"name":"College of Computer Science and Information Technology, Jazan University, Jazan, Saudi Arabia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Ahmad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"39747","published-online":{"date-parts":[[2023,7,25]]},"container-title":["Ars Combinatoria"],"original-title":[],"deposited":{"date-parts":[[2023,7,28]],"date-time":"2023-07-28T14:31:54Z","timestamp":1690554714000},"score":1,"resource":{"primary":{"URL":"https:\/\/combinatoire.com\/ars\/article\/A-Note-on-Distance-Irregular-Labeling-of-Graphs.pdf"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,25]]},"references-count":0,"URL":"https:\/\/doi.org\/10.61091\/ars156-04","relation":{},"ISSN":["0381-7032","2817-5204"],"issn-type":[{"type":"print","value":"0381-7032"},{"type":"electronic","value":"2817-5204"}],"subject":[],"published":{"date-parts":[[2023,7,25]]}}}