Metric dimension of enhanced hypercube networks
Rajan, Bharati; Rajasingh, Indra; Monica, Chris; Manuel, Paul
J. Comb. Math. Comb. Comput. 67, 5-15 (2008).
Detour graphs
Sampathkumar, E.; Swaminathan, V.; Visvanathan, P.; Prabakaran, G.
J. Comb. Math. Comb. Comput. 67, 17-21 (2008).
Memetic algorithm based vector quantizer
Jayanthi, V. S.; Shanmugam, A.
J. Comb. Math. Comb. Comput. 67, 23-34 (2008).
Investigation on raster CNN simulation by numerical integration algorithms
Ponalagusamy, R.; Senthilkumar, S.
J. Comb. Math. Comb. Comput. 67, 35-48 (2008).
On efficiently Roman dominatable graphs
Roushini, P.; Pushpam, Leely; Mai, T. N. M. Malini
J. Comb. Math. Comb. Comput. 67, 49-58 (2008).
Minimally k-equitable labeling of butterfly and Benes networks
Rajasingh, Indra; Rajan, Bharati; Arockiaraj, M.; Manuel, Paul
J. Comb. Math. Comb. Comput. 67, 59-66 (2008).
Exact wirelength of hypercube layout on k-cube necklace
Manuel, Paul; Rajasingh, Indra; Rajan, Bharati; Mercy, Helda
J. Comb. Math. Comb. Comput. 67, 67-76 (2008).
On node ranking of complete r-partite graphs
Lai, Yung-Ling; Chen, Yi-Ming
J. Comb. Math. Comb. Comput. 67, 77-85 (2008).
Prime filters in a pseudocomplemented semilattice
Balasubramani, P.; Viswanathan, R.
J. Comb. Math. Comb. Comput. 67, 87-97 (2008).
A new class of graceful lobsters
Sethuraman, G.; Jesintha, J. Jeba
J. Comb. Math. Comb. Comput. 67, 99-109 (2008).
Branches and joints in the study of self switching of graphs
Vilfred, V.; Joseph, J. Paulraj; Jayasekaran, C.
J. Comb. Math. Comb. Comput. 67, 111-122 (2008).
Wiener index for detour saturated trees
Babujee, J. Baskar; Joshi, A.
J. Comb. Math. Comb. Comput. 67, 123-129 (2008).
Parametric programming to the analysis of bulk arrival queueing model
Gani, A. Nagoor; Ritha, W.
J. Comb. Math. Comb. Comput. 67, 131-140 (2008).
Multi-font English character recognition based on modified invariant moments
Dhandra, B. V.; Malemath, V. S.; Mallikarjun, H.; Hegadi, Ravindra
J. Comb. Math. Comb. Comput. 67, 153-162 (2008).
Graph labelings, embedding and NP-completeness theorems
Acharya, B. D.; Germina, K. A.; Princy, K. L.; Rao, S. B.
J. Comb. Math. Comb. Comput. 67, 163-180 (2008).
Rupture degree of mesh and binary trees
Manuel, Paul; Rajasingh, Indra; Rajan, Bharati; Prabha, R.
J. Comb. Math. Comb. Comput. 67, 181-187 (2008).
Labeling generating matrices
Figueroa-Centeno, R. M.; Ichishima, R.; Muntaner-Batle, F. A.; Rius-Font, M.
J. Comb. Math. Comb. Comput. 67, 189-216 (2008).
On the Fekete-Szegö problem for some subclasses of analytic functions defined by convolution
Murugusundaramoorthy, G.; Kavitha, S.; Rosy, Thomas
J. Comb. Math. Comb. Comput. 67, 217-222 (2008).
Learning of finite coded Petri net languages
Kannamma, S.; Thomas, D. G.; Rangarajan, K.
J. Comb. Math. Comb. Comput. 67, 223-234 (2008).
Computing all repeats of a partial word
Sasikala, K.; Dare, V. R.; Thomas, D. G.
J. Comb. Math. Comb. Comput. 67, 235-248 (2008).




