default search action
Electronic Notes in Discrete Mathematics, Volume 48
Volume 48, July 2015
- S. Arumugam
, Dalibor Froncek
Preface. 1 - Alison Marr
Sparse Semi-Magic Squares and Magic Labelings of Directed Graphs. 3-10 - Andrea Semanicová-Fenovcíková
Wheels are Cycle-Antimagic. 11-18 - Martin Baca
A Survey of Irregularity Strength. 19-26 - Jay S. Bagga, Laure Pauline Fotso, Pambe Biatch' Max, S. Arumugam
New Classes of Graceful Unicyclic Graphs. 27-32 - M. Balakrishnan, G. Marimuthu, S. Arumugam
Vertex in-magic arc labelings of digraphs. 33-39 - Sylwia Cichacz
Group distance magic and antimagic graphs. 41-48 - Guang-Hui Zhang, Tao-Ming Wang:
E-Super Vertex Magic Regular Graphs of Odd Degree. 49-56 - Khee Meng Koh, L. Y. Phoon, Kian Wee Soh
The Gracefulness of the Join of Graphs. 57-64 - Mukti Acharya, Pranjali, Purnima Gupta:
Zero Ring Labeling of Graphs. 65-72 - G. Sethuraman, P. Ragukumar
Towards Optimal Embedding of an Arbitrary Tree in a Graceful Tree. 73-80 - Jessica Pereira, Tarkeshwar Singh, S. Arumugam
On (k, d)-Skolem Graceful Graphs. 81-88 - Amruth Sandhupatla, Sasthi C. Ghosh:
Gracefulness of vertex duplicated complete bipartite graph for static and incremental frequency allocation. 89-93 - Andreas Dwi Maryanto Gunawan, Khee Meng Koh:
The Nk-valued Roman Domination and Its Boundaries. 95-102 - S. Arumugam
Super (a, d)-edge antimagic total labelings of friendship and generalized friendship graphs. 103-110 - S. Arumugam
E-Super Vertex In-Magic Total Labelings of Digraphs. 111-118 - B. J. Balamurugan
k-Zumkeller Labeling for Twig Graphs. 119-126 - Samina Abbas Boxwala, Priyam Vashishta:
Some new families of Graceful Graphs. 127-133 - Devsi Bantva
Radio number of trees. 135-141 - Ramón M. Figueroa-Centeno, Rikio Ichishima, Francesc A. Muntaner-Batle, Akito Oshima:
Gracefully Cultivating Trees on a Cycle. 143-150 - Suresh Manjanath Hegde, Kumudakshi:
Graceful digraphs and complete mappings. 151-156 - P. Jeyanthi
Odd Mean Labeling of Chain of Graphs. 157-160 - P. Jeyanthi
Further Results on Vertex Equitable Graphs. 161-164 - P. Jeyanthi
Odd Harmonious Labeling of Some New Families of Graphs. 165-168 - P. Jeyanthi
Some results on edge pair sum labeling. 169-173 - P. Jeyanthi
Total Edge Irregularity Strength of Disjoint Union of Wheel Graphs. 175-182 - Nainarraj Kamatchi, A. Ramalakshmi, S. Nilavarasi, S. Arumugam
A note on Distance Magic and Distance antimagic graphs. 183-187 - K. M. Kathiresan
Cm-supermagic labeling of graphs. 189-196 - Khee Meng Koh, Kian Wee Soh
Dominating Broadcast Labeling in Cartesian Products of Graphs. 197-204 - Laxman Saha
On the Radio Number of Square of Graphs. 205-212 - G. Marimuthu, G. Kumar
On consecutive magic graphs. 213-215 - G. Kumar
On the degrees of E-super vertex-magic graphs. 217-222 - G. Marimuthu, G. Kumar
On V-super and E-super vertex-magic total labelings of graphs. 223-230 - G. Marimuthu, S. Stalin Kumar:
H-V-super magic decomposition of complete bipartite graphs. 231-233 - G. Marimuthu, S. Kavitha, M. Balakrishnan:
Super Edge Magic Graceful Labeling of Generalized Petersen Graphs. 235-241 - Mark Korenblit:
A Note on Algebraic Expressions of Rhomboidal Labeled Graphs. 243-250 - N. Neela, Selvaraj Chelliah:
Total Magic Cordial Labeling of Complete Multipartite Graphs. 251-254 - Pranjali, Mukti Acharya, Purnima Gupta:
Finite Abelian Group Labeling. 255-258 - G. Sethuraman, A. Velankanni:
(2, 1)-Total Labeling of a Class of Subcubic Graphs. 259-266 - Aloysius Godinho, Tarkeshwar Singh, S. Arumugam
On S-Magic Graphs. 267-273 - Jessica Pereira, Tarkeshwar Singh, S. Arumugam
A New Measure for Gracefulness of Graphs. 275-280 - Soumen Nandi
On L(k, k-1, ..., 1) labeling of triangular lattice. 281-288 - Srinivasa Rao Kola
Radio Numbers of Some Caterpillars. 289-296 - S. Stalin Kumar, G. Marimuthu:
H-E-super magic decomposition of complete bipartite graphs. 297-300 - S. P. Subbiah, J. Pandimadevi, R. Chithra:
Super total graceful graphs. 301-304
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: