14
Views
5
CrossRef citations to date
0
Altmetric
Articles

On total vertex irregularity strength of generalized uniform cactus chain graphs with pendant vertices

, &

References

  • A. Ahmad , M. Bača , Y. Bashir , Total vertex irregularity strength of certain classes of unicyclic graphs, Bulletin mathematiques de la Societe des sciences mathematiques de Roumanie, 57, 2, 147–152, 2014.
  • A. Ahmad , S.A. ul H. Bokhary , R. Hasni , Slamin , Total vertex irregularity strength of ladder related graphs, Science International (Lahore ), 26, 1, 1–5, 2014.
  • M. Anholcer , M. Kalkowski , J. Przybyło , A new upper bound for the total vertex irregularity strength of graphs, Discrete Mathematics , 309, 6316–6317, 2009. DOI: 10.1016/j.disc.2009.05.023
  • S. Ahmad , H.M. Afzal Siddiqui , A. Ali , M.R. Farahani , M. Imran , I.N. Cangul . On Wiener index and Wiener polarity index of some polyomino chains. Journal of Discrete Mathematical Sciences and Cryptography . 22(7), 1151-1164, (2019). DOI:10.1080/09720529.2019.1688965
  • M. Bača , M. Jendrol , S. Miller , J. Ryan , On irregular total labellings, Discrete Mathematics , 307, 1378–1388, 2007. doi:10.1016/j.disc.2005.11.075
  • M. Bača , S. Jendrol , Kathiresan, K. Muthugurupackiam, K. Semaničová-Fenovcikova , A Survey of Irregularity Strength, Electronic Notes in Discrete Mathematics , 48, 19–26, 2015. DOI:10.1016/j.endm.2015.05.004
  • K. Borissevich and T. Došlić , Counting dominating sets in cactus chains, Filomat , 29, 8, 1847–1855, 2015. doi: 10.2298/FIL1508847B
  • J.A. Gallian , A dynamic survey of graph labeling, Electronic Journal Of Combinatorics , 1, #DS6, 2018.
  • W. Gao , M.R. Farahani , The Zagreb topological indices for a type of Benzenoid systems jagged-rectangle, Journal of Interdisciplinary Mathematics , 20 (5), 1341–1348, 2017. doi: 10.1080/09720502.2016.1232037
  • W. Gao . Three algorithms for graph locally harmonious colouring. Journal of Difference Equations and Applications 23(1-2), 2017, 8-20. DOI: 10.1080/10236198.2015.1124101
  • D. Indriati , Widodo, I.E. Wijayanti, K.A. Sugeng, M. Bača, A. Semaničová-Fenovcikova , The total vertex irregularity strength of generalized helm graphs and prisms with outer pendant edges, Australasian Journal of Combinatorics ., 65, 14–26, 2016.
  • A. Sadeghieh , S. Alikhani , N. Ghanbari , A.J.M. Khalaf , Hosoya polynomial of some cactus chains, Cogent Mathematics , 4(1):1305638, 2017. DOI:10.1080/23311835.2017.1305638
  • X. Li , J.-B. Liu . A novel approach to speed up ant colony algorithm via applying vertex coloring. International Journal of Parallel, Emergent and Distributed Systems . 33(6), 2018, 608-617. DOI:10.1080/17445760.2017.1298758
  • Nurdin , E.T. Baskoro , A.N.M. Salman , Gaos , On the total vertex irregularity strength of trees, Discrete Mathematics . 310(21), 2010, 3043-3048. DOI:10.1016/j.disc.2010.06.041
  • I. Rosyida , Mulyono , D. Indriati , Determining Total Vertex Irregularity Strength of Tr(4,1) Tadpole Chain Graph and its Computation, Procedia Computer Science, 157, 699–706, 2019. doi: 10.1016/j.procs.2019.09.152
  • I. Rosyida , E. Ningrum , A. Setyaningrum , Mulyono , On total edge and total vertex irregularity strength of pentagon cactus chain graph with pendant vertices, Journal of Physics: Conference Series , 1567, 2020, 022073.
  • W. D. Wallis , Magic Graphs, 1st ed. Boston : Birkhäuser Basel, 2001.
  • L. Yan , Y. Li , X. Zhang , M. Saqlain , S. Zafar , M.R. Farahani . 3-total edge product cordial labeling of some new classes of graphs. Journal of Information & Optimization Sciences . 39(3), 2018, 705–724. DOI:10.1080/02522667.2017.1417727
  • H. Yang , M.A. Rashid , S. Ahmad , M.K. Siddiqui , M. F. Hanif . Cycle super magic labeling of pumpkin, octagonal and hexagonal graphs. Journal of Discrete Mathematical Sciences and Cryptography . 22(7), 1165-1176, (2019). DOI:10.1080/09720529.2019.1698800

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.