New constructions of super edge bimagic labeling
Baskar Babujee, J.; Babitha, S.; Vishnupriya, V.
J. Comb. Math. Comb. Comput. 79, 23-31 (2011).
Wiener index of sodium chloride and benzenoid structures
Al-Kandari, Ahmad; Manuel, Paul; Rajasingh, Indra
J. Comb. Math. Comb. Comput. 79, 33-42 (2011).
On Rolf Nevanlinna prize winners collaboration graph
Yegnanarayanan, V.; Umamaheswari, G. K.
J. Comb. Math. Comb. Comput. 79, 43-58 (2011).
Path partitionable graphs
Sethuraman, G.
J. Comb. Math. Comb. Comput. 79, 59-64 (2011).
Full friendly index set. II
Sinha, Deepa; Kaur, Jaspreet
J. Comb. Math. Comb. Comput. 79, 65-75 (2011).
One-factor resolvability of grid derived networks
Rajan, Bharati; Thomas, Sonia K.; Monica M, Chris
J. Comb. Math. Comb. Comput. 79, 77-89 (2011).
Application of array-token Petri nets in generating English alphabetic letters
Usha, P.; Immanuel, Beulah; Sattanathan, R.
J. Comb. Math. Comb. Comput. 79, 91-98 (2011).
Kernel in oriented biregular graphs
Punitha M., Joice
J. Comb. Math. Comb. Comput. 79, 99-109 (2011).
Acyclic kernel number of oriented cycle related graphs
Rajasingh, Indra; Rajan, Bharati; Joice, S. Little
J. Comb. Math. Comb. Comput. 79, 111-120 (2011).
Packing of hexagonal networks
Muthumalai, Albert; Rajasingh, Indra; Shanthi, A. S.
J. Comb. Math. Comb. Comput. 79, 121-127 (2011).
On the crossing number of honeycomb related networks
Rajan, Bharati; Rajasingh, Indra; Beulah, P. Vasanthi
J. Comb. Math. Comb. Comput. 79, 129-137 (2011).
E
mbedding in fat trees
Rajasingh, Indra; Rajan, Bharati; Rajan, R. Sundara; Manuel, Paul
J. Comb. Math. Comb. Comput. 79, 139-146 (2011).
A learning algorithm for a subclass of tree rewriting systems
Jayasrirani, M.; Thomas, D. G.; Nagar, Atulya K.; Robinson, T.
J. Comb. Math. Comb. Comput. 79, 147-161 (2011).
Betweenness centrality of honeycomb networks
Rajasingh, Indra; Rajan, Bharati; Isido D, Florence
J. Comb. Math. Comb. Comput. 79, 163-172 (2011).
A study on (a,d)-antimagic graphs using partition
Vilfred, Vilfred K.; Florida, L. Mary
J. Comb. Math. Comb. Comput. 79, 173-187 (2011).
Graphs with minimum spanner ς(G)≥2ρ−1
William, Albert; Kishore, Antony; Manuel, Paul
J. Comb. Math. Comb. Comput. 79, 189-195 (2011).
Equi-toughness partitions of graphs
Sundareswaran, R.; Swaminathan, Venkata
J. Comb. Math. Comb. Comput. 79, 197-210 (2011).
Fuzzy inner product spaces
Xavier, D. Antony; Jose, Magie
J. Comb. Math. Comb. Comput. 79, 211-219 (2011).
Relative character graph using group representation
Nagalakshmi, K. T.; Jeyakumar, A. Vincent
J. Comb. Math. Comb. Comput. 79, 221-234 (2011).
On the radio number of the hexagonal mesh
Rajan, Bharathi; Yenoke, Kins
J. Comb. Math. Comb. Comput. 79, 235-244 (2011).
Radio antipodal number of certain graphs
William, Albert; Kenneth, Charles Robert
J. Comb. Math. Comb. Comput. 79, 245-249 (2011).
An approximation algorithm for the achromatic number of circulant graphs G(n;±{1,2}),G(n;±{1,2,3})
Arul, Sharmila Mary; Felix, J. Maria Roy; Rani, Nirmala
J. Comb. Math. Comb. Comput. 79, 251-259 (2011).




