Communications and Network

Communications and Network

ISSN Print: 1949-2421
ISSN Online: 1947-3826
www.scirp.org/journal/cn
E-mail: cn@scirp.org
"L(0, 1)-Labelling of Cactus Graphs"
written by Nasreen Khan, Madhumangal Pal, Anita Pal,
published by Communications and Network, Vol.4 No.1, 2012
has been cited by the following article(s):
  • Google Scholar
  • CrossRef
[1] Zobecněná L (p, q)-ohodnocení grafů
2022
[2] -Labeling problems on trapezoid graphs
2021
[3] L (h, k)-Labeling of Intersection Graphs
2020
[4] The Radiocoloring Problem on Some Graphs
2019
[5] Surjective L (2, 1)-labeling of cycles and circular-arc graphs
Journal of Intelligent & Fuzzy Systems, 2018
[6] L (j, k)-labeling Number of Cactus Graph
2018
[7] L(0, 1)-Labelling of Trapezoid Graphs
2017
[8] L (3, 2, 1)-and L (4, 3, 2, 1)-labeling problems on interval graphs
AKCE International Journal of Graphs and Combinatorics, 2017
[9] L (0, 1)-Labelling of Trapezoid Graphs
International Journal of Applied and Computational Mathematics, 2017
[10] Heuristic Algorithms For Broadcasting In Cactus Graphs
2017
[11] - and -labeling problems on interval graphs
2017
[12] L (0, 1)-and L (1, 1)-labelling problems on circular-arc graphs
International Journal of Soft Computing, 2016
[13] L (0, 1)-and L (1, 1)-labeling problems on circular-arc graphs
2016
[14] G(A, B)-labeling of cacti over groups
AIP Conference Proceedings, 2016
[15] G (A, B)-labeling of cacti over groups
2016
[16] L (0, 1) and L (1, 1) Labeling Problems on Circular-Arc Graphs
2016
[17] L (3, 1)-Labeling of Some Simple Graphs
AMO - Advanced Modeling and Optimization, 2016
[18] L(0,1)-labelling of Permutation Graphs
Journal of Mathematical Modelling and Algorithms in Operations Research, 2015
[19] Adjacent Vertex Distinguishing (Avd) Edge Colouring of Permutation Graphs
2015
[20] L (2, 1)-Labeling of Permutation and Bipartite Permutation Graphs
Mathematics in Computer Science, Springer, 2015
[21] L(2, 1)-Labeling of Permutation and Bipartite Permutation Graphs
Mathematics in Computer Science, 2015
[22] L(1, 2)-edge-labelings for lattices
Applied Mathematics-A Journal of Chinese Universities, 2014
[23] Some Adjacent Edge Graceful Graphs
Annals of Pure and Applied Mathematics, 2014
[24] L (2, 1)-labelling of Circular-arc Graph
arXiv preprint arXiv:1407.5488, 2014
[25] Complexity to Find Wiener Index of Some Graphs
arXiv preprint arXiv:1409.1987, 2014
[26] Algorithms to Find Wiener Index of Some Graphs
K Das - researchmathsci.org, 2014
[27] L (1, 2)-edge-labelings for lattices
Applied Mathematics-A Journal of Chinese Universities, Springer, 2014
[28] L (2, 1)-labeling of interval graphs
Journal of Applied Mathematics and Computing, 2014
[29] Variation of graceful labeling on disjoint union of two subdivided shell graphs
Annals Pure Applied Math, 2014
[30] Edge Magic Total Labeling of the Cycle Cn with P3 Chords
2014
[31] Conflict-Free Coloring of Extended Duplicate Graph of Twig
2014
[32] Open Neighborhood C
2013
[33] An Efficient Algorithm to Solve L (0, 1)-Labelling Problem on Interval Graphs
AMO - Advanced Modeling and Optimization, 2013
[34] Open Neighborhood Coloring of Prisms
j.math.fund.sci., 2013
[35] Open Neighborhood Coloring of Graphs
Int. J. Contemp. Math. Sciences, 2013
[36] Open Neighborhood Coloring of Prisms.
2013
[37] Clustering in Wireless Sensor Network using K-MEANS and MAP REDUCE Algorithm
2012
Free SCIRP Newsletters
Copyright © 2006-2024 Scientific Research Publishing Inc. All Rights Reserved.
Top