- Dwijendra K. Ray-Chaudhuri, A. R. Rao, B. K. Roy:
**Preface: Volume 15.**1

- B. Devadas Acharya, Purnima Gupta:
**On graphs whose domination numbers equal their independent domination numbers.**2-4

- B. Devadas Acharya, Shalini Joshi:
**On The Complement Of An Ambisidigraph.**5

- B. Devadas Acharya, Mukti Acharya:
**A New Characterisation of Connected Hypergraphs.**6-9

- Mukti Acharya, Tarkeshwar Singh:
**Skolem Graceful Signed Graphs.**10-11

- Mukti Acharya, Deepa Sinha:
**A Characterization of Line Sigraphs.**12

- Nirmala Achuthan, N. R. Achuthan, M. Simanihuruk:
**On the Nordhaus-Gaddum Problem for the k-Defective Chromatic Number of a Graph.**13-15

- N. R. Achuthan:
**Single Item Multi-period Multi-retailer Inventory Replenishment Problem with Restricted Order Size.**16-19

- M. L. Agarwal, Seema Gupta:
**BCH codes and Designs.**20-22

- Narendra Agarwal, Ajit A. Diwan:
**Triangle-factors in powers of graphs.**23-25

- K. T. Arasu, Grady Burkett, Michael Linger:
**Existence Status of Some Previously Open Abelian Difference Sets.**26

- Tiru S. Arthanari:
**On Pedigree Polytopes and Hamiltonian Cycles.**27-29

- Alphonse Baartmans, Sharad S. Sane:
**A characterization of Projective Subspaces of Codimension two as Quasi-Symmetric Designs with Good Blocks.**30

- R. Badrinath, Pratima Panigrahi:
**Graceful Labeling of Balanced Stars of Paths.**31-33

- Bhaskar Bagchi:
**On strongly regular graphs with µ >= 2.**34

- Simanda Bagchi, Mausumi Bose:
**Optimal main effect plans in blocks and related nested row-column designs.**35

- K. Balasubramanian, V. Parameswaran, S. B. Rao:
**Characterization of Cycle Stochastic Graphs.**36

- B. Basavanagoud:
**A criterion for maximal (minimally non-) outer planarity of total-block graph of a graph.**37-38

- Robert Benkoczi, Binay K. Bhattacharya, David Breton:
**Efficient computation of 2-medians in a tree network with positive/negative weights.**39-42

- Subir Kumar Bhandari, Mausumi Bose:
**Some Results Related to Permanental Inequalities.**43

- A. Bhattacharya, G. R. Vijayakumar:
**An Integrality Theorem of Root Systems.**44

- N. S. Bhave:
**A Characterization of Forcibly Tripartite Self-Complementary class of Partitioned Sequences.**45-48

- Kiran R. Bhutani, Azriel Rosenfeld:
**Geodesies in Fuzzy Graphs.**49-52

- Derek Bingham, Rahul Mukerjee:
**Detailed Wordlength Pattern of Regular Fractional Factorial Split-Plot Designs in Terms of Complementary Sets.**53

- Noureddine Bouhmala:
**A Multilevel Genetic Algorithm for the Traveling Salesman Problem.**54

- Tiziana Calamoneri, Rossella Petreschi, Andrzej Pelc:
**Labeling trees with a condition at distance two.**55-58

- N. Chandrasekaran, N. Sridharan:
**Discrete Fuzzy Matroids.**59

- Manoj Changat, Joseph Mathew, Henry Martyn Mulder:
**Induced Path Transit Function, Betweenness and Monotonicity.**60-63

- Sheshayya A. Choudum, V. Sunitha:
**Distance and Short Parallel Paths in Augmented Cubes.**64

- Christian Germain, Hamamache Kheddouci:
**Grundy coloring for power graphs.**65-67

- Ashok Kr. Das, Malay Kr. Sen:
**Asteroidal Triple of Edges in Bichordal Graphs: A Complete list.**68-70

- Prabir Das, Shibaji Mukherjee:
**Algorithms for Resource Discovery in Distributed Networks.**71

- Premadhis Das:
**On Designs with Pencilwise Orthogonality and Balance.**72-74

- Sandip Das, P. Talukdar, Malay Sen:
**Homogeneously Representable Interval Bigraphs.**75-78

- Dameng Deng, Hao Shen, Rolf S. Rees:
**On the Existence of Nearly Kirkman Triple Systems with Subsystems.**79-81

- Rajendra S. Deodhar, Murali K. Srinivasan:
**An inversion number statistic on set partitions.**82-84

- Sugata Gangopadhyay, Pradipkumar H. Keskar, Subhamoy Maitra:
**Patterson-Wiedemann Construction Revisited.**85-90

- Indivar Gupta, Laxmi Narain, C. E. Veni Madhavan:
**Cryptological Applications of Permutation Polynomials.**91

- Kishan Chand Gupta, Palash Sarkar:
**Computing Walsh Transform from the Algebraic Normal Form of a Boolean Function.**92-96

- S. M. Hegde, Sudhakar Shetty:
**Super Edge Least-Magic Graphs.**97

- S. M. Hegde:
**Further Results on Set Sequential and Set Graceful Graphs.**98-102

- Medha Huilgol, Hanumappa B. Walikar, B. Devadas Acharya:
**DDR Graphs of Diameter Three.**103

- S. P. Inamdar:
**The dual code of small linear spaces.**104

- Yury J. Ionin, Mohan S. Shrikhande:
**Decomposable Symmetric Designs.**105

- S. S. Kamath, R. S. Bhat:
**Domination in Semigraphs.**106-111

- S. S. Kamath, Saroja R. Hebbar:
**Strong and Weak Domination, Full Sets and Domination Balance in Semigraphs.**112

- S. S. Kamath, Saroja R. Hebbar:
**Domination Critical Semigraphs.**113

- Sukhamay Kundu:
**Random Generation of Combinatorial Structures using Context-Fee Grammars.**114

- Meena Mahajan, Raghavan Rama, Vijayakumar Sundarrajan:
**On Sorting by 3-Bounded Transpositions.**115-118

- S. Mandal:
**Improving Convergence Rates of a Class of Algorithms.**119-124

- Y. Manoussakis, H. P. Patil:
**Bipartite Graphs and their Degree Sets.**125

- S. Mishra, S. B. Rao:
**Minimum Monopoly in Regular and Tree Graphs.**126

- G. B. Mund, S. B. Rao, C. K. Mohapatra:
**Solutions of a problem of Ore on spanning trees and its generalization.**127-130

- N. S. Narasimha Sastry:
**Intersection pattern of Ree subgroups in G**131-133_{2}(q), q = 3^{2n+l}> 3.

- Timothy E. O'Brien:
**Practical Design Strategies for the Detection of Drug Synergy.**134-137

- Rajendranath Panda:
**Sequential Quality-Quantity Type Second Order Rotatable Design.**138

- Pantelimon Stanica, Subhamoy Maitra:
**Rotation Symmetric Boolean Functions -; Count and Cryptographic Properties.**139-145

- H. P. Patil, C. Rajasekaran:
**On Generalized Line Graphs with Crossing Number One.**146

- S. Ramachandran:
**Reconstructing Digraphs from Partial Dadecks.**147

- A. R. Rao:
**The number of reachable pairs in a digraph.**148-150

- C. R. Rao:
**Combinatorics: Applications to Experimental Designs and Sample Surveys.**151-153

- C. R. Rao, D. Raghava Rao:
**Combinatorics and Applications to Experimental Designs.**154

- P. S. S. N. V. P. Rao, S. B. Rao, G. M. Saha, B. K. Sinha:
**Optimal Designs for Covariates' Models and Mixed Orthogonal Arrays.**155-158

- Suryaprakash Nagoji Rao:
**Prime Labelings.**159

- Rita SahaRay, Jennifer Seberry:
**Critical Sets in Orthogonal Arrays.**160

- E. Sampathkumar S. R. Sudarshan, B. Devadas Acharya, Suresh Nayak:
**Super magical Partitions of an Integer.**161-163

- E. Sampathkumar, B. Devadas Acharya, Siddani Bhaskara Rao, Sheshayya A. Choudum:
**Studying Properties of Graphs through their k-vertex Subsets: I IIkappa-complete Graphs and IIkappa-completion numbers.**164-167

- E. Sampathkumar, B. Devadas Acharya, Purnima Gupta:
**Studying Properties of Graphs through Their k-vertex Subsets II. Notions of domination, coloring and covering.**168-174

- G. Santhosh, G. Suresh Singh:
**A Theorem on Sum Graphs.**175

- Palash Sarkar, Subhamoy Maitra:
**Balancedness and Correlation Immunity of Symmetric Boolean Functions.**176-181

- Malay Sen, P. Talukdar, Sandip Das:
**Chronological Orderings of Interval Digraph.**182-185

- M. M. Shikare, Ghodratollah Azadi, B. N. Waphare:
**Generalization of Splitting off Operation to Binary Matroids.**186-188

- Miklós Simonovits, Vera T. Sós:
**Different levels of randomness in Random Ramsey theorems.**189-192

- N. M. Singhi:
**Tags on Subsets.**193-195

- Mohit Singh, Amitabha Tripathi:
**Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree.**196-197

- N. Sridharan, M. D. Elias, V. S. A. Subramanian:
**Characterization of Graphs G for which**198-200*I*.

- N. Sridharan, R. Lalithambal:
**A Study on Hamiltonian Matroids.**201

- C. Simil kumar:
**Least Common Multiple of a Cycle and a Star.**202-204

- V. Swaminathan, P. Jeyanthi:
**Super Edge - Magic Strength of Fire Crackers, Banana Trees and Unicyclic Graphs.**205-206

- V. Swaminathan, R. Poovazhaki:
**Point Set and Strong Point Set Domination in Graphs 1 Minimum spsd sets.**207-210

- V. Swaminathan, P. Thangaraju:
**Gallai-type theorems in domination and strong domination parameters.**211

- V. Swaminathan, P. Sumathi:
**Subdivision Number of Graphs and Falsity of a conjecture.**212

- V. Swaminathan, P. Thangaraju:
**Strong and weak domination in graphs.**213-215

- Hanumappa B. Walikar, P. R. Hamipholi, Harishchandra S. Ramane:
**Some Minimal Graphs by Interlacing Eigenvalues.**216-218

- Hanumappa B. Walikar:
**Partial Complement of a Graph.**219-221

- Hanumappa B. Walikar, Harishchandra S. Ramane:
**On the Eigenvalues of a Graph.**222-224

- Yejing Wang, Jennifer Seberry, Reihaneh Safavi-Naini, Ryoh Fuji-Hara:
**A Note on the Exposure Property of SBIBD.**225-227

- Albert William, Indra Rajasingh, Jasintha Quadras, Paul Manuel:
**Embedding of Generalized Wheels into Arbitrary Trees.**228-231

- Jin Yuan, Cunsheng Ding:
**Secret Sharing Schemes from Two-Weight Codes.**232

- Gyula O. H. Katona:
**A coding problem for pairs of subsets.**233-236

- Renu C. Laskar, John Villalpando:
**Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs.**237-240

- S. Arumugam, Hepzibai Jeyakumar:
**Asteroidal Chromatic Number of a Graph.**241-243

- Hanumappa B. Walikar, D. N. Misale, R. L. Patil, Harishchandra S. Ramane:
**On the Resistance Distance of a Tree.**244-245