Edge irregular reflexive labeling for the disjoint union of gear graphs and prism graphs. (English) Zbl 1401.05265
Summary: Given a graph \(G=(V,E)\), an edge naming is a mapping of an element of \(E\) to an arrangement of marks. In this case, the diagram is called an edge-marked graph. We consider an edge irregular reflexive \(k\)-labeling for the disjoint association of wheel-related diagrams and deduce the correct estimation of the reflexive edge strength for the disjoint association of \(m\) copies of some wheel-related graphs, specifically gear graphs and prism graphs.
MSC:
| 05C78 | Graph labelling (graceful graphs, bandwidth, etc.) |
| 05C12 | Distance in graphs |
| 05C90 | Applications of graph theory |
References:
| [1] | Chartrand, G.; Jacobson, M.S.; Lehel, J.; Oellermann, O.R.; Ruiz, S.; Saba, F.; Irregular networks; Congr. Numer.: 1988; Volume 64 ,187-192. · Zbl 0671.05060 |
| [2] | Lahel, J.; Facts and quests on degree irregular assignment; Proceedings of the Sixth Quadrennial International Conference on the Theory and Applications of Graphs: ; ,765-782. |
| [3] | Amar, D.; Togni, O.; On irregular strenght of trees; Discret Math.: 1998; Volume 190 ,15-38. · Zbl 0956.05092 |
| [4] | Dimitz, J.H.; Garnick, D.K.; Gyárfás, A.; On the irregularity strength of the m × n grid; J. Graph Theory: 1992; Volume 16 ,355-374. · Zbl 0771.05055 |
| [5] | Gyárfás, A.; The irregularity strength of Km,m is 4 for odd m; Discret Math.: 1998; Volume 71 ,273-274. · Zbl 0681.05066 |
| [6] | Nierhoff, T.; A tight bound on the irregularity strength of graphs; SIAM. J. Discret. Math.: 2000; Volume 13 ,313-323. · Zbl 0947.05067 |
| [7] | Ahmad, A.; Al Mushayt, O.; Bača, M.; On edge irregularity strength of graphs; Appl. Math. Comput.: 2014; Volume 243 ,607-610. · Zbl 1335.05126 |
| [8] | Bača, M.; Jendroľ, S.; Miller, M.; Ryan, J.; On irregular total labellings; Discrete Math.: 2007; Volume 307 ,1378-1388. · Zbl 1115.05079 |
| [9] | Ahmad, A.; Bača, M.; Siddiqui, M.K.; On edge irregular total labeling of categorical product of two cycles; Theory Comp. Syst.: 2014; Volume 54 ,1-12. · Zbl 1284.05232 |
| [10] | Siddiqui, M.K.; Afzal, D.; Faisal, M.R.; Total edge irregularity strength of accordion graphs; J. Comb. Optim.: 2017; Volume 34 ,534-544. · Zbl 1376.05137 |
| [11] | Siddiqui, M.K.; Miller, M.; Ryan, J.; Total edge irregularity strength of octagonal grid graph; Util. Math.: 2017; Volume 103 ,277-287. · Zbl 1379.05097 |
| [12] | Siddiqui, M.K.; On irregularity strength of convex polytope graphs with certain pendent edges added; Ars Comb.: 2016; Volume 129 ,199-210. · Zbl 1413.05345 |
| [13] | Bača, M.; Siddiqui, M.K.; On total edge irregularity strength of strong product of two cycles; Util. Math.: 2017; Volume 104 ,255-275. · Zbl 1383.05268 |
| [14] | Bača, M.; Siddiqui, M.K.; Total edge irregularity strength of generalized prism; Appl. Math. Comput.: 2014; Volume 235 ,168-173. · Zbl 1334.05135 |
| [15] | Ryan, J.; Munasinghe, B.; Tanna, D.; Reflexive irregular labelings; ; . |
| [16] | Bača, M.; Irfan, M.; Ryan, J.; Semaničovǎ-Feňovčkovǎ, A.; Tanna, D.; On edge irregular reflexive labelings for the generalized friendship graphs; Mathematics: 2017; Volume 67 ,2-11. · Zbl 1391.05221 |
| [17] | Tanna, D.; Ryan, J.; Semaničovǎ-Feňovčkovǎ, A.; A reflexive edge irregular labelings of prisms and wheels; Australas. J. Combin.: 2017; Volume 69 ,394-401. · Zbl 1375.05243 |
| [18] | Brandt, S.; Miškuf, J.; Rautenbach, D.; On a conjecture about edge irregular total labellings; J. Graph Theory: 2008; Volume 57 ,333-343. · Zbl 1188.05109 |
| [19] | Bača, M.; Irfan, M.; Ryan, J.; Semaničovǎ-Feňovčkovǎ, A.; Tanna, D.; Note On reflexive irregular edge labelings of graphs; AKCE Intern. J. Graphs Comb.: 2018; . |
| [20] | Tomescu, I.; Javaid, I.; On the metric dimension of the Jahangir graph; Bull. Math. Soc. Sci. Math. Roum.: 2007; Volume 50 ,371-376. · Zbl 1164.05019 |
| [21] | Ma, K.J.; Feng, C.J.; On the gracefulness of gear graphs; Math. Pract. Theory: 1984; Volume 4 ,72-73. |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
