## SUBJECT

- African Studies
- Anthropology
- Advertisment
- Aquaculture
- Biology
- Botany
- Business
- Chemistry
- Economics
- Food & Nutrition
- Geography
- International Affairs
- Language & Literature
- Mathematics
- Political Science
- Political Science & International Affairs
- Psychology
- Quality Management/ Statistics
- Science
- Social Science
- Sociology
- Statistics
- Technology
- View All

- Home
- Journal of Combinatorics, Information & System Sciences : A Quarterly International Scientific Journal

# Journal of Combinatorics, Information & System Sciences : A Quarterly International Scientific Journal

**ISSN:**0250-9628

**e-ISSN:**0976-3473

**Subject:**Mathematics

**Periodicity:**Quarterly

**DOI:**10.32381/JCISS

**Month(s) of Publication:**Mar., Jun., Sept. & Dec.

**Current Volume:**44 (2019)

- About the Journal
- Indexing & Abstracting
- Editors
- Current Issue
- Previous Issue(s)
- Instructions to Authors
- Ethics Policy
- Call For Papers
- Copyright

Journal of Combinatorics & System Sciences (JCISS) publishes significant original papers and survey articles on important advances, carrying theoretical and practical results of Mathematical orientation in any one of the following major areas:

**Combinatorics** (e.g., Graph Theory, finite Geometries, Combinatorial Geometries, Combinatorial Problems in Number Theory and Abstract Algebra, Coding Theory, Block/Factorial Designs, Search and Combinatorial Problems in Statistical Inference).

**Information Theory** (e.g., The Shannon Theory, Rate-Distortion Theory, Theory of Error-Correcting Codes, Detection and Estimation, Communication, Sampling Theorems, and Stochastic Processes, Pattern Recognition, Measures of Information and their Applications in Physical Sciences, Social Sciences, Commerce and Business Management, Humanities, and Statistics)

**Mathematical System Theory** (e.g., Topological Dynamics, Theory and Dynamical Poly systems, General System Theory, Formal System Theory, Reliability Theory and Practice, Mathematical Theory of Automation and Algorithms, Algebraic System Theory, Ergodic Theory, and Mathematical Linguistics)

**Computational Intelligence Techniques** (e.g., Fuzzy set theory and its generalizations, Soft set theory, Computing with Words, Neutrosophic Sets, and Systems, Interval Analysis, Rough Sets, Algorithmic Developments and Applications in Real-Life Problems.

Journal of Combinatorics & System Sciences is published four times a year. As a result, the journal serves as a forum for all researchers and practitioners engaged in research and development in these fields.

Journal of Combinatorics & System Sciences also presents refereed surveys, book reviews, tutorial articles, and comments on already published papers in JCISS. Special issues devoted exclusively to any important subarea of the journal may also be published.

**Sites are:**

EBSCO Discovery Service

Mathematical Reviews

Zentralblatt MATH

OCLC WorldCat Discovery Service

Indian Citation Index (ICI)

ProQuest

Genamics (JournalSeek)

### Chief Editor

- Bhu Dev Sharma, Former Prof. of Mathematics, SA-704, Gulmohar Towers, 6/25, Chiranjiv Vihar, Ghaziabad, U.P. - 201002 (India) E-mail: sharmafourm@yahoo.com

### Managing Editor

- Deepankar Sharma, Dr. K.N.Modi Institute of Engg.& Tech. Modi Nagar, U.P E: deepankarxyz@gmail.com

### Associate Editor

- Rajkumar Verma, University of Chile, Chile E: rkver83@gmail.com

### Editorial Board

- Toby Berger, University of Verginia, USA
- Pascale Charpihn, INRIAA-Paris, France
- D. K. Ray-Chaudhuri, Ohio State University, USA
- Charles J. Colbourn, Arizona State University
- B. K. Dass, University of Delhi, India
- Michael J. Ferrara, University of Colorado Denver, USA
- Robert G. Gallager, Massachusetts Institute of Technology, USA
- Ron Gould, Emory University, USA
- Peter Horak, University of Washington, USA
- Michail Ch. Klin, Ben Gurion University of Nagev, Israel
- Jose M. Merigo Lindahi, University of Technology Sydney, Australia
- W. Mader, University of Hannover, Germany
- Takis Papaioannou, University of Piraeus, Greece
- C. R. Rao, Pennsylvania Sstate University, USA
- Alexander Raju, McMaster University, Canada
- Alexander Schrijver, University of Amsterdam, The Netherlands
- Ram P. Sharma, National Institute of Technology-AP, India
- K. P. Shum , Yannan University, China
- Deepa Sinha, South Asian University, India
- Henk Van Tilborg, Unversiteit Eindhoven, The Netherlands
- Junzo Watada, Wasede University, Japan
- D.J.A. Welsh, Oxford University, UK
- Dong Ye, Middle Tennessee State University, USA
- Viswanath Ramakrishna, University of Texas at Dallas, USA

### Volume 44 (2019) Issue 1-4 , (January-2019 to December-2019)

Jan-Dec

**Algorithms for the Polar Decomposition in Certain Groups and the Quaternion Tensor Square**
* by Francis Adjei, Marcus Cisneros, Deep Desai, Samreen Khan, Viswanath Ramakrishna and Brandon Whiteley *

**Abstract:**Constructive algorithms, not even requiring 2×2 eigencalculations, are provided for finding the entries of the positive definite factor in the polar decomposition of matrices in many groups. These groups include the indefinite orthogonal groups of signature (1, n – 1) nd (n – 1, 1) and fifteen groups preserving certain bilinear forms in dimension four. The Lorentz group belongs to both classes. Some of these algorithms extend to the indefinite orthogonal groups of arbitrary signature with nominal additional work. These procedures are then used to find quaternionic representations for the four dimensional groups mentioned above, analogous to the representation of the special orthogonal group via a pair of unit quaternions. A key ingredient is a characterization of positive definite matrices in these groups. Two algorithms are proposed for the Lorentz group. The former also works for the group whose signature is (n – 1, 1) and (1, n – 1). The second enables (and is aided by) the inversion of the double covering of the Lorentz group by SL(2, C). A key observation is that the inversion of the covering map, when the target is a positive definite matrix, can be achieved essentially by inspection as we demonstrate. For the group whose signature matrix is I2,2 a completion procedure based on the aforementioned characterization of positivity leads to yet another algorithm for the computation of the polar decomposition. For the other four dimensional groups, explicit isomorphisms provided by quaternion algebra lead to methods for the polar decomposition. As byproducts we give a simple proof of the fact that positive definite matrices in each of these groups belong to the connected component of the identity, find an explicit expression for their logarithm, and provide a characterization of the symmetric matrices in the connected component of the identity of two of these groups in terms of their preimages in the corresponding covering group.

DOI -https://doi.org/10.32381/JCISS.2019.44.1-4.1

**Subclass of Analytic Functions in Conic Domains Associated with Symmetric q– Derivative Operator**
* by M. Govindaraj, S. Sivasubramanian, and G. Murugusundaramoorthy *

**Abstract:**Motivated by the works of Kanas and R|ducanu [18] and Kanas and Yaguchi [16], we define and the new class k-ST (α), parabolic starlike functions associated with symmetric q-calculus operator and investigated several interesting properties of the function class related to the domains bounded by conical sections.

DOI -https://doi.org/10.32381/JCISS.2019.44.1-4.2

**Convexities, Centroids in Graphs and their Application in Mobile Ad hoc Networks**
* by Prakash Veeraraghavan *

**Abstract:**Mobile ad hoc networks (MANET) are continuously self-configuring, infrastructureless network of mobile devices connected wirelessly. They found their application everywhere from a military tactical application to a casual video gaming. In MANET, every mobile node is expected to route packets on-behalf of other nodes. Depending on the position in the network, some nodes are expected to route more packets than other nodes. This process will deplete more of their battery power than other nodes. In this paper, we model this problem through the classical g-convexity in graphs. We also prove that the g-centroid location problem for any arbitrary connected graph is NP-hard. AMS classification: 05C85, 05C90

DOI -https://doi.org/10.32381/JCISS.2019.44.1-4.3

**A Note on Monotone Algorithms for Catalytic Converter Model**
* by Rupsha Roy and V. Antony Vijesh *

**Abstract:**Recently, a few researchers studied a coupled system of first order partial differential equation arising from a catalytic converter and interesting existence and uniqueness results have been proved. Later, the same system has been solved using finite difference method after linearizing it using a monotone iterative scheme. Even though all the iterative schemes considered were proved to have linear convergence, numerical examples suggest that certain iterative scheme converges faster than the others. The theoretical justification for the above behavior is missing in these works. This short note intents to bridge this gap by providing a mathematical justification for the faster convergence.

DOI -https://doi.org/10.32381/JCISS.2019.44.1-4.4

**Limit Formulas Related to q-Gamma and q-Digamma Functions at their Singularities
**

*by Sourav Das and A. Swaminathan*

**Abstract:**In this work we present some limit formulas of ratios between q-gamma functions, q-digamma functions and their derivatives at their singularities. The recent methods developed for gamma functions are used in order to obtain main results. 2010 Mathematics Subject Classification. 33D05, 33B15.

DOI -https://doi.org/10.32381/JCISS.2019.44.1-4.5

**One Dimensional Sub-hyperbolic Equation via Sequential Caputo Fractional Derivative
**

*by Aghalaya S. Vatsala and Yunxiang Bai*

**Abstract:**It is well known that the fractional derivative is global in nature compared with integer derivatives. In addition, the fractional dynamic equations represent as better and as more economical models compared with dynamic systems with integer derivative. In this work, we obtain a representation formula for the one dimensional sequential sub hyperbolic linear nonhomogeneous problem with initial and Dirichlet boundary conditions. This is achieved by using the eigenfunction expansion method and Green’s formula. In addition, we have used the Laplace transform method to solve the sequential time derivative dynamic equation. Our result yields the well known integer result as a special case. AMS (MOS) Subject Classification. 34A08, 35C15, 35L04.

DOI -https://doi.org/10.32381/JCISS.2019.44.1-4.6

**Computations in Ancient Indian Mathematics
**

*by V. Ramakalyani*

**Abstract:**Since the early times, methods of computation were developed and perfected in India. The development of the decimal place value system, computations on numbers, fractions and zero, first order indeterminate equations, their applications to astronomy and combinatorics as noticed in early Indian mathematics are discussed briefly in this paper. Attempt is made to show that computer programs can be written for the algorithms given by the ancient Indian mathematicians. Though these works were written several centuries ago they are suitable for application even today. 2010 Mathematics Subject Classification.

DOI -https://doi.org/10.32381/JCISS.2019.44.1-4.7

**Legendre Wavelet based Solution to Burgers’ and Coupled Burgers’ Equation
**

*by K. Harish Kumar and Ram Jiwari*

**Abstract:**In this paper a quasilinearization based Legendre wavelet numerical scheme is pro posed for time dependent one dimensional Burgers’ and coupled Burgers’ equation. The present method is completely independent of time disctrization contrast to the recent literature for time disctrization based on wavelet scheme for Burgers’ and coupled Burgers’ equation. One of the advantages of the proposed scheme is that they capture the physical behavior of Burgers’ and coupled Burgers’ equations efficiently for large Reynolds numbers with less number of grid points. Further, straightforward numerical implementation makes them an effective alternative to the existing schemes.

DOI -https://doi.org/10.32381/JCISS.2019.44.1-4.8

**Cyber – Physical Systems: Mathematics, Logic and Computation**
* by T V Gopal *

**Abstract:**Cyber-Physical Systems [CPS] are evolving and dynamic systems comprising digital, analog, physical, and human components engineered to collaborate through a feasible integration of physics and logic with the notions of time and free will. The Bergson’s view of time is within the ambit of the Greek metaphysics. Cybernetics provides an interdisciplinary systemic view of collaborating components. This paper is an essay on the emerging Cyber – Physical Systems and the role of Cybernetics, Software Development and Computational Mathematics in making them function to a purpose.

DOI -https://doi.org/10.32381/JCISS.2019.44.1-4.9

**Evaluation of the Discounted Warranty Cost of Minimally Repaired Series Systems under Gamma and Mixed Exponential Failure Laws
**

*by Naga Sunil Kumar Gandikota, Mohd Hilmi Hasan and Jafreezal Jaafar*

**Abstract:**Various factors should be considered in the modeling of DWC of repairable systems or products, including system structure, component failure processes, discounting methods, and the warranty policy itself. This paper presents discounted warranty cost (DWC) models for repairable series systems subject to Gamma and Mixed Exponential Failure Laws. In particular, a policy on a free repair warranty and a policy on a pro-rata guarantee are being studied. The impact of repair actions on the failure times of the components is assumed to be minimal, hence NHPPs is used to describe the failure processes. This paper considers two types of discounting methods: a continuous discount function and a discrete discount function. Expressions for both the expected value and the variance of DWC are obtained for Gamma and Mixed Exponential Failure Laws. The WRD was calculated for Gamma Failure Laws under application section. Further extension of this research is provided in the conclusion section.

DOI -https://doi.org/10.32381/JCISS.2019.44.1-4.10

**On Use of Range Rate Information in Target Tracking under Dense Clutter Background in Airborne Radars
**

*by Narasimhan RS and TV Prakash Rao*

**Abstract:**Data association techniques in radar target tracking problem play an important role in tracking targets of interest with high accuracy during both target non-maneuvering and maneuvering phases in a multiple target scenario. The data association problem further gets complicated due to the presence of detections from clutter leaks and false alarms in addition to detections from targets of interest. These techniques have to cater for uncertainty in the origin of measurement and low to moderate probability of detection of targets of interest. In this paper, we propose to utilize range rate information extensively to reduce plot to track miss-correlation, detect target maneuvers early, estimate target manoeuver intensity and choose optimum revisit rate as well as waveform to maximize target visibility. Tracking range rate is essential to exploit this information in tracking functions. This poses a problem due to its highly nonlinear relation to Cartesian target states. Use of nonlinear tracking filters have been shown to suffer from stability issues in addition to being sub-optimum. In this paper, we propose to decouple the tracking of range rate and position by using two parallel Interacting Multiple Model (IMM) filters. The range rate filter consists of four models in IMM framework to track range and range rate of targets in non-maneuvering and maneuvering phases. Since range rate is highly sensitive to target kinematic changes, a reliable and early maneuver detection is possible in range rate dimension and this is exploited in the design of tracking filter. We propose an efficient maneuver tracking algorithm using the electronic beam steering feature of phased array radars to detect and track evasive target maneuvers. In addition, the range rate filter is used to estimate the maneuver intensity and choose optimum update rate for tracking. Finally, the maneuver tracking performance of position tracking filter is improved by adapting mode transition probability matrix. We establish the performance of range rate and position tracking filters for non-maneuvering and maneuvering targets through simulations.

DOI -https://doi.org/10.32381/JCISS.2019.44.1-4.11

**Computational Mathematics for Software Reliability Engineering**
* by Subburaj Ramasamy *

**Abstract:**This is an extensive tutorial introducing the state of art in Software Reliability Engineering and associated metrics. Software Reliability Engineering (SRE) encompasses many tasks such as Reliability Growth Testing (RGT) based on software reliability growth modeling, assessment of operational reliability, software release time determination and determination of estimated testing time or required testing efforts and resources. The foremost activity in SRE is Software Reliability growth modeling to plan and execute RGT which is carried out as final testing activity in the software development life cycle (SDLC) and is known in different names such as system testing. This phase in SDLC requires extensive use of Computational Mathematics to estimate parameters of the software reliability growth model (SRGM). In this paper, we will briefly discuss the various SRGM parameter estimation methodologies and conclude that the Least Squares methodology provides a satisfactory solution in all situations.

DOI -https://doi.org/10.32381/JCISS.2019.44.1-4.12

**Experimental Study of Intermediate Filters applied to Robust Optical Flow Estimation in Digital Images **
* by Vanel Lazcano *

**Abstract:**Optical flow (OF) is the motion of pixels between two consecutive images. Variational models are used to estimate the OF. The flow that minimizes this model is the OF of the image sequence. The minimization procedure performs a coarse-to-fine approach. In each iteration, the estimated OF is processed with an intermediate filter (IF) to eliminate noise. We considered a robust OF model, and we tested it with different IF to improve OF estimation. Using the best IF and best parameters, we have evaluated the model in state-of-the-art dataset obtaining position 113 of 192 methods. Our approach outperforms similar techniques, such that SPARSEFLOW.

DOI -https://doi.org/10.32381/JCISS.2019.44.1-4.13

**Cryptanalysis of a Group Key Transfer Protocol: Generalization and Countermeasures
**

*by Appala Naidu Tentu, Kallepu Raju and V. Ch. Venkaiah*

**Abstract:**In Cryptography, group key distribution protocol is a mechanism in which a group key is generated and distributed by Key Generation Centre (KGC) to a set of communicating parties in a group. This group key generally ensures secure communication among communicating parties on an insecure channel. Key establishment protocols allow two or more communicating parties to establish their common secret key called a session key. Harn and Lin protocol(HL) is one such protocol and it is based on Shamir’s threshold secret setting. Nam et al. exposed the vulnerability in HL protocol through their replay attack and proposed a countermeasure using a nonce mechanism. In this paper, we are general- izing the replay attack presented by Nam et al. and proposing an alterna- tive countermeasure without using nonce mechanism. The novelty of our countermeasure is that KGC is not required to detect replay messages and hence each user doesn’t need to compute authentication messages as in Nam et al. Presented countermeasure thereby brings down the computational complexity of the scheme. Also, we propose an improved version of HL protocol a version that uses short signatures for authentication and overcomes drawbacks, and is resistant to existing attacks.

DOI -https://doi.org/10.32381/JCISS.2019.44.1-4.14

**Compliant Ternary Matrices based on Restricted Isometry Property: Construction and Application to Image Retrieval
**

*by R. Ramu Naidu, M. Srinivas and C. S. Sastry*

**Abstract:**The class of matrices possessing compliance with the Restricted Isometry Property (RIP) provides data of certain types with sparse representation. The ternary matrices with 0, ±1 as their elements have the potential to result in fast algorithms. The existing ternary constructions combine binary and bipolar (Hadamard) matrices. In the present work, however, we construct deterministic and sparse ternary matrices from the known binary matrices. The resulting ternary matrices are shown to be better-behaved, in terms of their sparse recovery properties, than the input binary matrices. As our construction does not use bipolar matrices, it avoids the need for bipolar matrices. This saves memory space and computational cost when our method is implemented on computer. In addition, our matrices are very sparse compared to their generating binary matrices. We demonstrate that the ternary matrices constructed herein work well for dimensionality reduction in wavelet domain. In particular, through experimental work, we show that the wavelet weighted ternary matrices are capable of being used for applications like content based image retrieval.

DOI -https://doi.org/10.32381/JCISS.2019.44.1-4.15

**Some Interesting Properties of the Matrix Classes (ℓ,c) and (ℓ, c; p’)**
* by P N Natarajan *

**Abstract:**In this paper, entries of sequences and innite matrices are real or complex numbers. We prove some nice properties of the innite matrix classes (l,c) and (l,c;P′) 2000 Mathematics Subject Classication. 40C05, 40D05, 40H05.

DOI -https://doi.org/10.32381/JCISS.2019.44.1-4.16

### Volume 43 (2018)

#### Volume 43 (2018) Issue 1-4 Comb , (January-2018 to December-2018)

January-December

**Construction of Normal Bases over Finite Fields**
* by P. L. Sharma, Kiran Devi and Arun Kumar *

**Abstract:**Normal bases in finite fields are of much importance in many applications of cryptography and coding theory. The arithmetic computations of normal bases in finite fields are fast. In the extensions of finite fields there exist normal elements. A normal element generates the normal basis. In the present paper, we use a root of an irreducible polynomial and the trace function associated with it to obtain the normal element of the normal polynomial. Further, we find the normal basis whose elements are exactly the roots of the normal polynomial DOI:-https://doi.org/10.32381/JCISS.2018.43.1-4.1

**Maximum Distance Separable Hankel Rhotrices over Finite Fields**
* by P. L. Sharma, Arun Kumar and Shalini Gupta *

**Abstract:**Maximum Distance Separable (MDS) matrices are important components of the diffusion layer in the cryptographic ciphers. Rhotrices are represented by coupled matrices. Therefore, the use of rhotrices in cryptographic ciphers increase the security of the data in cryptosystems. We define Hankel rhotrix and construct the MDS rhotrices using Hankel rhotrices over finite fields. DOI:-https://doi.org/10.32381/JCISS.2018.43.1-4.2

**Partitioning Ideals of a Semiring R and its Skew Group Semiring R * G**
* by Richa Sharma and Madhu *

**Abstract:**Let G be a finite group acting on a semiring R and R _ G its skew group semiring. Then the quotient semiring RQ(I) is isomorphic to , RQg(Ig) for each g ∈ G. Further, if I is a G–invariant, Q–ideal of R, then I _ G is a Q _ G – ideal of R _ G. Assume that R is additively cancellative, then RQ(I) is additively cancellative (see [6]) and hence (RQ(I))Δ exists which is isomorphic to , R Q _(I _) where Q is an additive subgroupoid of R. In this case, ((R _ G)Q _ G(I _ G))Δ ≅ ((RΔ _ G)Q Δ_ G(I Δ_ G)) DOI:-https://doi.org/10.32381/JCISS.2018.43.1-4.3

**Morita Equivalence Between H–fixed Semialgebra And Smash Product Semialgebra**
* by V. Selvan and M. Devendran *

**Abstract:**In this paper, we study Hopf algebra(H) action on a semialgebra A and its smash product semialgebra A#H. We study the semimodule theoretic connection between the semialgebra A and its smash product semialgebra A#H. In this paper, we prove the Masches-type theorem for the smash product A#H. Further, we establish the Morita equivalence between H–fixed semialgebra AH and the smash product semialgebra A#H. DOI:-https://doi.org/10.32381/JCISS.2018.43.1-4.4

**Packing Copies of Cartesian Product of certain classes of Paths and Cycles into Power graphs**
* by Medha Itagi Huilgol and V. Sriram *

**Abstract:**An H -packing of a graph G is a set L = {H1,H2,...,Ht} of edge-disjoint subgraphs of G, where each subgraph Hi is isomorphic to H. In this paper, we have proved (Cm_Cn)|(Cm_Cn)k for m, n ≥ 2k – 1, with m, n, relatively prime to all numbers less than or equal to k and for the particular cases of m, n ≡ 0, 2 or 4(mod 6), n ≥ 8, we have (Cm_Cn)|(Cm_Cn)3 . Also we have found the maximum possible packing of Pn_Cm in (Pn_Cm)3 for n ≥ 4 and m ≥ 3 when m is even. DOI:-https://doi.org/10.32381/JCISS.2018.43.1-4.5

**A Formula for Pentanacci-Like Sequence**
* by Pankaj *

**Abstract:**Many papers are concerning a variety of generalizations of the Fibonacci sequence. In this paper, we define a Pentanacci-Like sequence in terms of first five terms and then derive the general formula for n^th term of the Pentanacci -Like sequence. DOI:-https://doi.org/10.32381/JCISS.2018.43.1-4.6

**Ordered Power Product of Polynomials and Product Quasi Cyclic Codes**
* by Ankita Gaur *

**Abstract:**Quasi cyclic codes, special type of cyclic codes, are an important class of implementable codes. In previous paper a new type of product of polynomial called, “Ordered Power Product of Polynomials” (OPP) was introduced. By means of this new kind of product of polynomials we defined OPP of two cyclic codes and developed a scheme of getting a cyclic code from the OPP of two cyclic codes. Also, it was shown that the code obtained by OPP of polynomials is more efficient than the code obtained by Kronecker type of product of same constituent codes. In this paper we apply the Ordered Power Product on quasi cyclic codes. DOI:-https://doi.org/10.32381/JCISS.2018.43.1-4.7

**Effectiveness Analysis of Two Unit Cold Standby System with Fault Detection, Inspection And Priority**
* by Neha Sharma, J P Singh Joorel and Darpandeep Kour *

**Abstract:**This paper deals with a two unit (non-identical) system in which first unit is operative and other is kept as cold standby. On failure upon of first unit (main unit), the standby unit (secondary unit) becomes operative while failed unit puts first for fault detection and then for its repair. If no fault is detected then it becomes again operative. There is also a inspection policy for main unit to check whether the repair is perfect or not. In case the repair is not perfect it is again put under post repair. If both the units stop working the system will shut down. The main unit gets priority for both operation and repair. There is a single repair facility which is available with the system for repair as well as for fault detection, inspection and post repair. The distributions associated to different times including repair time of main unit, random variables, are assumed to be exponential but with different parameters while the post repair time of main unit and repair time of secondary unit is taken as general. Using regenerative point technique the various characteristics of the system have been obtained which help in studying the effectiveness of the system such as transition probabilities, mean time to system failure, availability, busy period of repairman and expected profit incurred. DOI:-https://doi.org/10.32381/JCISS.2018.43.1-4.8

**Modified -graph G(m) of some special graphs**
* by V. Anusuya and R. Kala *

**Abstract:**Gerd H. Frickle et al. [1] introduced γ -graph of a graph. Consider the family of all γ - sets in a graph G and we define G(γ ) = (V (γ ), E(γ )) to be the graph whose vertices correspond 1 to 1 with the γ sets of G and two γ -sets say S1 and S2 are adjacent in G(γ ) if there exist a vertex v ∈ S1 and a vertex w ∈ S2 such that v is adjacent to w and S1 = S2 – {w} ∪ {v} or equivalently S2 = S1 – {v} ∪ {w}. The concept of γ –graph inspired us to define Modified γ -graph of a graph. Consider the family of all γ -sets of a graph G and define the modified γ -graph G(γ m) = (V (γ m), E(γ m)) of G to be the graph whose vertices V (γ m) correspond 1-1 with the γ -sets of G and two γ -sets S1 and S2 form an edge in G(γ m) if there exists a vertex v ∈ S1 and w ∈ S2 such that S1 = S2 – {w} ∪ {v} and S1 = S2 – {v} ∪ {w}. In this paper we determine G(γ m) of some special graphs. DOI:-https://doi.org/10.32381/JCISS.2018.43.1-4.9

**On Certain Types of Product Set-Labeling of Graphs**
* by Sudev Naduvath *

**Abstract:**The product set of two sets A and B of integers, denoted by A*B, is the set A*B = {ab : a ∈ A, b ∈ B}. For X ⊆ N, a product set-labeling (PS-labeling) of a graph G is an injective function ƒ : V (G) → P(X) such that the induced function f* : V (G) → P(X) is defined as ƒ*(uv) = ƒ(u)*ƒ(v)≤ uv ∈ E(G), ƒ(u) *ƒ(v) being the product set of ƒ(u) and ƒ(v). The PS-labeling of a graph can be classified into certain types in two ways: in accordance with the cardinalities of the set-labels and according to the nature of the collection of set-labels of elements of the graph G. This paper discusses different types of PS-labeling of graphs. DOI:-https://doi.org/10.32381/JCISS.2018.43.1-4.10

**A New Class of Fuzzy Implication on LI **
* by Satya Prakash Singh and Balasubramaniam Jayaram *

**Abstract:**In multi-valued logic, different domains of truth values are considered and hence it is imperative to define logical operations that respect the underlying structure. One such important logical connective is the implication. The lattice LI is used to capture the semantics of interval-valued fuzzy sets. In this work, we propose a new class of fuzzy implications on the lattice LI and discuss the different properties possessed by them. DOI:-https://doi.org/10.32381/JCISS.2018.43.1-4.11

**The Study of Near-Ring by Some Standard Groups**
* by R. Purohit and H.K. Paliwal *

**Abstract:**In the present paper it is shown that every Near-Ring satisfies some identity properties. Moreover, some examples are given which prove the necessity of identity properties for Near-Rings. DOI:-https://doi.org/10.32381/JCISS.2018.43.1-4.12

**The Study of Derivational Commuting on a Near-Ring**
* by R. Purohit and H.K. Paliwal *

**Abstract:**In this paper we introduce the notion of Semiprime Near-Ring with various derivations commuting on it. The main purpose of this paper is to study and investigate some results on derivations which are commuting on Semiprime Near-Ring Nr. DOI:-https://doi.org/10.32381/JCISS.2018.43.1-4.13

**Sequential Estimation of the Lomax Distribution**
* by Sumit Koul *

**Abstract:**Sequential procedure is developed for minimum risk point estimation of the Lomax distribution under quadratic plus linear cost of sampling of the shape parameter. Secondorder approximations are derived for the expected sample size and regret associated with sequential procedure. DOI:-https://doi.org/10.32381/JCISS.2018.43.1-4.14

**Some Enumerative Properties of a Class of Fibonacci-like Cubes**
* by Xuxu Zhao, Xu Wang and Haiyuan Yao *

**Abstract:**A filter lattice is a distributive lattice formed by all filters of a poset in the antiinclusion order. We study the combinatorial properties of the Hasse diagrams of filter lattices of certain posets, so called Fibonacci-like cubes, in this paper. Several enumerative polynomials, e.g. rank generating function, cube polynomials and degree sequence polynomials are obtained. Some of these results relate to Fibonacci sequence and Padovan sequence. DOI:-https://doi.org/10.32381/JCISS.2018.43.1-4.15

### Volume 42 (2017)

#### Volume 42 (2017) Issue 1-4 , (January-2017 to December-2017)

January-December

**Fuzzy Network Flow Problems**
* by Feblin C. Kennedy and S.U. Malini *

**Abstract:**

The concept of octagonal fuzzy numbers was introduced by the authors in an earlier paper [14]. In this paper, solution to network flow problems using octagonal fuzzy numbers are dealt with. viz, finding the shortest path of the network and project completion time. These problems were dealt with by several authors under different circumstances for different types of fuzzy numbers (to cite a few, [2] ,[3], [6], [7], [10]). In this paper the duration of activities are defined by octagonal fuzzy numbers which are more realistic and general in nature. Ranking using α–cut [14] is used to compare octagonal fuzzy numbers.

An algorithm is proposed to find fuzzy shortest path and fuzzy critical path of a project. Fuzzy shortest path, fuzzy critical path, fuzzy project completion time, fuzzy earliest start time, fuzzy earliest finish time, fuzzy latest start time, fuzzy latest finish time and fuzzy slack time for all activities are obtained as octagonal fuzzy numbers that captures the problem in a more realistic way.

**A Note on the Sparing Number of Generalised Petersen Graphs**
* by Sudev Naduvath, Chithra Kaithavalappil and Germina Augustine *

**Abstract:**

Let X denote a set of non-negative integers and P(X) be its power set. An integer additive set-labeling (IASL) of a graph G is an injective set-valued function ƒ : V (G) → P(X) – {φ} where induced function ƒ+ : E (G) → P(X) – {φ} is defined by ƒ+(uv) = ƒ(u) + ƒ(v), whereƒ(u) + ƒ(v) is the sumset of ƒ(u) and ƒ(v). The cardinality of the set-label of an element of G is said to be the set-indexing number of that element. A weak integer additive set-labeling is an IASL, in which the set-indexing number of every edge is equal to the set indexing number of at least one of its end vertices. The sparing number of a graph G is the minimum number of edges having set indexing number 1 required for G to admit weak IASL. In this paper, we discuss the sparing number of certain generalised Petersen graphs.

**Hope Algebra Action on Semialgebras**
* by M. Devendran and V. Selvan *

**Abstract:**

Let A be a k – semialgebra and let H be a k – Hopf algebra. In this paper we introduce the action of the Hopf algebra H on the semialgebra A. Also we study some ideal theoretic connection between the semialgebra A, its H – fixed subsemialgebra AH, by using the connection between ideals of the algebras of differences A of A, (AH) of AH.

**Estimation and Testing Procedures for the Reliability Functions of the Moore and Bilikam Family of Lifetime Distributions under Progressive type II right censoring**
* by Ajit Chaturvedi and Narendra Kumar *

**Abstract:**

In this article the Moore and Bilikam family of lifetime distributions is considered which covers many lifetime distributions as specific cases. Two measures of reliability R(t) = P(X>t) and P=P(X >X*) are considered. Point estimation and testing procedures are developed for R(t) and P under progressive type II right censoring. Three types of point estimators namely, uniformly minimum variance unbiased, maximum likelihood and invariantly optimal estimators are considered. Asymptotic confidence intervals are developed for the parameters θ and β. Testing procedures are also developed for the hypotheses related to different parametric functions. A comparative study of different methods of estimation is done through Monte Carlo simulation study.

**Disjoint Union Metric Spaces**
* by Meenakshi *

**Abstract:**

From the given metrics di on disjoint sets Xi, i = 1,2,3..., we define a new metric d on their union X so that it becomes a metric space. Further, we relate open spheres of the given sets to the open spheres of X so as to determine the structure of an open set in X. Finally, by using the inclusion mappings, we observe that the disjoint union topology of the topologies generated by di ’s on Xi ’s is the same as the topology generated by metric d on X.

**Constructions of Maximum Distance Separable Toeplitz Rhotrices over Finite Fields**
* by P. L. Sharma and S. Gupta *

**Abstract:**

Maximum Distance Separable (MDS) Matrices are used in block ciphers to achieve the maximum diffusion. Use of rhotrices increase the security as these are the representations of coupled matrices. We define Toeplitz rhotrix and construct the MDS rhotrices using Toeplitz rhotrices over finite fields.

**Some New Properties of k-Jacobsthal and k-Jacobsthal-Lucas Numbers**
* by Pankaj *

**Abstract:**

In this paper, some new properties of k-Jacobsthal and k-Jacobsthal-Lucas numbers are derived and proved by using matrices. The identities, which have been proved in this paper, are not encountered in the k-Jacobsthal and k-Jacobsthal-Lucas numbers literature.

**Prioritized Information Fusion Method for Uncertain Linguistic Information and its Application to Multiple Attribute Group Decision Making**
* by Rajkumar Verma *

**Abstract:**

In this paper, we investigate the uncertain linguistic multiple attribute group decision making (MAGDM) problems in which the attributes and decision-makers are in different priority levels. By combining the idea of quasi-arithmetic mean and prioritized weighted average (PWA) operator, we first propose a new aggregation operator called quasi-uncertain linguistic prioritized weighted average (QULPWA) operator for aggregating uncertain linguistic information. The properties of the new aggregation operator are studied in detail and their special cases are examined. Furthermore, based on the QULPWA operator, an approach to deal with multiple attribute decision-making problems under uncertain linguistic environments is developed. Finally, a practical example about the selection of university faculty is provided to illustrate the developed multiple attribute decision-making process.

**Restricted 2-Burst-Correcting Non-Binary Optimal Codes**
* by Vinod Tyagi and Tarun Lata *

**Abstract:**

Burst is the most common error in almost all communication channels and burst error correcting codes are developed to deal with such errors. According to Fire [7], a burst of length b or less is a vector whose all the non-zero components are confined to some b consecutive positions, the first and the last of which is non-zero. In this paper, we have introduced the idea of “restricted burst”, which is the modification of the definition of a burst. By a restricted burst of length b or less we mean a vector whose all the non-zero components are confined to some b consecutive positions, the first and last of which is nonzero with a restriction that all the non-zero consecutive positions contain same field element. For example in non-binary case for q = 3, n = 3 and b = 2, we have the following vectors of restricted burst of length 2 or less 110, 220, 011, 022, 100, 200, 010, 020, 001, 002. This idea may look hypothetical from practical point of view but we know it is true for binary case. Also the work may not have any practical utility at present but it is interesting from theoretical point of view. In this work, we present two construction techniques for optimal codes with respect to restricted burst of length 2 or less for linear as well as for byte oriented codes with redundancy r ≥3.

**Properties of Generalized k-Jacobsthal like Sequence Using Matrices**
* by Pankaj *

**Abstract:**

The Jacobsthal sequence has been generalized in many ways, some by preserving the initial conditions, others by preserving the recurrence relation. In this paper, we define a new generalization {Mk,n} n = 1,with initial conditions Mk,o = 2Mk,1= m+k, which is generated by the recurrence relation Mk,n+1 = kMk,n + 2Mk,n–1 for n ≥ 1, where k, m are integer numbers. Some new properties concerning this new generalization have been described using matrix algebra.

**Ideals in Gamma Semirings**
* by Tilak Raj Sharma And Shweta Gupta *

**Abstract:**

In this paper, the concept of ideals, k –ideals are introduced and their properties are studied. These results will be used to obtain some other new results such as the operations on ideals, the inclusion preserving bijection between the set of all ideals of a semiring R and the set of all ideals of Rn,n and other properties are studied. Moreover, ideals of Notherian and regular semirings are generalized.

**Local Metric Dimension of Families of Certain Graphs**
* by Fancy V F and V Jude Annie Cynthia *

**Abstract:**

Let G(V, E) be a graph with vertex set V and edge set E. Then a subset of V namely W is said to be a local metric basis of G, if for any two adjacent vertices u, v V\W, there exists a vertex w W, such that d(u, w) d(v,w). The minimum cardinality of local metric basis is called the local metric dimension of G and is denoted by l (G). In this paper we discuss the local metric basis of some simple graphs and investigate the local metric dimension of some families of Generalised Petersen graph. Also we discuss the local metric basis of Circulant graphs in this paper.

**Group {1,–1,i,–i}Cordial Labeling of Some New Graphs**
* by M.K. Karthik Chidambaram, S. Athisayanathan and R. Ponraj *

**Abstract:**

Let G be a (p,q)graph and A be a group. Let f :V (G) A be a function. The order of u A is the least positive integer n such that un = e. We denote the order of u by o(u). For each edge uv assign the label 1 if (o(f(u)),o(f(v))) = 1 or 0 otherwise. f is called a group A Cordial labeling if |vf(a) –vf(b)| 1 and |ef(0) –ef(1)| 1, where vf(x) and ef(n) respectively denote the number of vertices labeled with an element x and number of edges labeled with n(n = 0,1). A graph which admits a group A Cordial labeling is called a group A Cordial graph. In this paper we define group {1,–1,i,–i} Cordial graphs and prove that the Sunflower graph SFn, the graph Lotus inside a circle LCn, the Umbrella graph Un,n are all group {1,–1,i,–i} Cordial for all n. We further characterize Jewel graphs that are group {1,–1,i,–i} Cordial.

### Volume 41 (2016)

#### Volume 41 (2016) Issue 4 , (October-2016 to December-2016)

Oct-Dec

**Cordial labeling of arbitrary supersubdivision of wheel, helm, closed helm**
* by Ujwala Deshmukh and Smita A. Bhatavadekar *

**A Computational Method For Minimum Of Octagonal Fuzzy Numbers And Its Application to Decision Making**
* by Dhanalakshmi V. and Felbin C. Kennedy *

**Remark On Variance Bounds **
* by R. Sharma and R. Bhandari *

**Some New Determinantal Identities of K-Pell Sequences**
* by Pankaj *

**Cryptanalysis and Improvement of Two Provably Secure Certificateless Signature Schemes **
* by Pankaj Kumar and Vishnu Sharma *

**Relationships between a Semiring R and Quotient Semiring RQ(I)**
* by Ram Parkash Sharma, Madhu and Richa Sharma *

**The explicit factorization of x2n –μ over finite fields **
* by Manjit Singh, Sudhir Batra *

**Convection Driven by Surface Tension and Buoyancy in a Relatively Hotter or Cooler Layer of Liquid with Free slip Bottom**
* by A. K. Gupta and D. Surya *

#### Volume 41 (2016) Issue 1-3 Comb , (January-2016 to September-2016)

January - September

**Metric Dimensions of Crystals**
* by Ajay Kumar *

**On (k, d)-Hooked Skolem Graceful Graphs
**

*by Jessica Pereira, Tarkeshwar Singh and S. Arumugam*

**On the Harmonious Coloring of Certain Class of Graphs
**

*by Medha Itagi Huilgol and V.Sriram*

**Radio Number of 1, 2 - Cartesian Product of Paths**
* by Raaghave Sood, P. Venkata Subba Reddy and D. Rambabu *

**Enquete on the Existence of Hamiltonian Graph**
* by Ajay Kumar *

**A Characterization Theorem for gbent Function Over Z_16**
* by P. L. Sharma And N. Dhiman *

**On Bounds for Fourth Central Moment**
* by R. Sharma and R. Saini *

**Morita Equivalence Between Partial Actions and Global Actions for Semialgebras**
* by Ram Parkash Sharma and Meenakshi *

**Some Conditions on Gamma Semirings**
* by Tilak Raj Sharma And Shweta Gupta *

**Generalized Uncertain Linguistic Prioritized Weighted Average Operator with application in Multiple Attribute Group Decision-Making**
* by Rajkumar Verma *

**Characterization of Disconnected Two-Cyclic Graphs With A Self Vertex Switching**
* by C. Jayasekaran and G. Sumathy *

**Generalised Altering Distance Functions for Six Mappings Satisfying Subcompatible Condition**
* by Anushri A. Aserkar and Manjusha P. Gandhi *

### Volume 40 (2015)

#### Volume 40 (2015) Issue 1-4 Comb , (January-2015 to December-2015)

January-December

**A Dually Flat Geometry of the manifold of F-escort Probability Disttribution**
* *

**Positive Linear Functionals and GerÃ…Â¡orin Disks of Matrices**
* by R. Sharma & R. Kumar *

**Super Geometric Mean Labeling**
* by S.S. Sandhya, E. Ebin Raja Merly and B. Shiny *

**Convergence of Best Proximity Point Theorems
**

*by S. Arul Ravi and A. Anthony Eldred*

**Prime Correspondence Between a Graded Semiring R and its Identity Component R
**

*by Rosy Joseph And Ram Parkash Sharma*

**Series of Generalized Incomplete Trojan-type Designs
Seema Jaggi, Cini Varghese And Eldho Varghese**

*by Seema Jaggi, Cini Varghese And Eldho Varghese*

**An Algorithm to Detect S-consistency in Line Sigraph**
* by Deepa Sinha and Anshu Sethi *

**Population Selection Based on Count Data**
* by Madhuri S. Mulekar *

**Signed Domination in Signed Graphs
**

*by H.B. Walikar, Satish V. Motammanavar and B. D. Acharya*

**Some New Results on Mean Graphs
**

*by S. S. Sandhya, S. Somasundaram and S. Anusa*

**Geometric Mean Labeling of Graphs Obtained by Subdividing Quadrilateral Snakes
**

**On Weakly Indexable Graphs
**

*by S.M. Hegde and P. Shankaran*

**A Class of Nonparametric Tests Based on Sample Quantiles**
* by Narinder Kumar *

**Wavelet Based Numerical Simulation of Non Linear Klein/Sine Gordon Equation**
* by V. Antony Vijesh and K. Harish Kumar *

**On a Dual of a Theorem due to ChvÃƒÂ¡tal-komlÃƒÂ³s**
* by Sriraman Sridharan *

**Construction of Graceful Directed Graphs**
* by S.M. Hegde and Kumudakshi *

**Cover**
* *

### Volume 39 (2014)

#### Volume 39 (2014) Issue 1-4 Comb. , (January-2014 to December-2014)

January-December

**The M/M/1/K Interdependent Retrial Queueing Model with Controllable Arrival Rates **
* by B. Antline Nisha, M. Thiagarajan and A. Srinivasan *

**Some Results on the Splitting Signed Graphs S(S) **
* by Mukti Acharya, Rashmi Jain and Sangita Kansal *

**Panarity of Eccentric Digraph of Graphs **
* by Medha Itagi Huilgol and Syed Asif Ulla S *

**Relations for Moments of Generalized Order Statistics from Chen Distribution and Its Characterization **
* by Taruna Kumari and Anupam Pathak *

**Construction of Fractional Factorial Designs with Some Linear Trend Free Effects through Finite Field **
* by Poonam Singh, Puja Thapliyal and Veena Budhraja *

**Some Properties of the Euler Summability Method in Complete Ultrametric Fields **
* by R. Deepa, P.N. Natarajan and V. Srinivasan *

**Multisample Testing Problem Related to Lorenz Curves **
* by Sangeeta Arora, Kalpana K. Mahajan and Preety Rattan *

**Balanced Treatment Block Designs with Nested Rows and Columns **
* by Rajender Parsad, Niti Agarwal, P.R. Sreenath and B.N. Mandal *

**Trend Free Block Designs Balanced for Interference Effects from Neighbouring Experimental Units **
* by Arpan Bhowmik, Seema Jaggi, Cini Varghese and Eldho Varghese *

**A. Anu and S. Monikandan**
* *

**Analysing Censored Data on First Birth Interval for Heterogeneous Group of Females **
* by Anup Kumar and R.C. Yadava *

**Finite Abelian Group Labeling of Graphs **
* by Pranjali, Mukti Acharya and Purnima Gupta *

**Assessing Causal Effects with Truncation Due to Death and Missing Mortality Status **
* by Megan Price, Vicki S. Hertzberg, and David W. Wright *

**On Generalized Fuzzy Divergence Measure and their Application to Multi-criteria Decision Making **
* by Rajkumar Verma *

**A New Method of Construction of a Series of Nested Balanced Incomplete Block Designs **
* by Dr. Keerti Jain and Dr. Vineeta Singh *

**Statistical Inference and Confidence Intervals for Absolute Partial Mean dominance **
* by P. Bansal, S. Arora and K.K. Mahajan *

**Prediction Interval for the Smallest Value in a Future Sample Based on Imprecise Data **
* by S.P. Mukherjee & Natasa Dasgupta *

**On a Bivariate Version of Zero-Inflated Logarithmic Series Distribution and Its Properties **
* by C. Satheesh Kumar and A. Riyaz *

### Volume 38 (2013)

#### Volume 38 (2013) Issue 1-4 Comb , (January-2013 to December-2013)

January-December

**Interference in Graphs **
* by B D Acharya, Germina KA, Rency Kurian, Viji Paul and Thomas Zaslavsky *

**Non-parametric Tests for Testing Simple Ordered Alternative of Scale Parameters
Using Two-Sample Statistics
**

*by Amar Nath Gill, Vishal Maurya and Parminder Singh*

**Optimum Values Of A Moment For Prescribed Two Other Moments **
* by Anju Rani and Shalu Garg *

**Optimization Techniques of Multi-hopping and Probabilistic Approach for Hierarchical Clustered WSN Obtained by Genetic Algorithm Approach
**

*by Shuchita Upadhyaya and Premlata Yadav*

**Inequalities Among Generalized Information Measures of Type S And Its Applications In Information Theory**
* by K. C. Jain and Ram Naresh Saraswat *

**Optimization of Caching Mechanism to prevent Stale routes in DSR Protocol**
* by Shuchita Upadhyaya and Jaideep Atri *

**On the Splitting Signed Graphs**
* by Deepa Sinha, Pravin Garg and Hina Saraswat *

**On the Splitting Signed Graphs **
* by Deepa Sinha, Pravin Garg and Hina Saraswat *

**Vertex Labeled/Colored Graphs, Matrices and Signed Graphs **
* by E. Sampathkumar and M. A. Sriraj *

**More Properties of C0(P) over Non-Archimedean Fields **
* by P N Natarajan *

**Canonical-Sign-Compatibility of some Signed Graphs**
* by Deepa Sinha and Ayushi Dhama *

**Canonical-Sign-Compatibility of some Signed Graphs **
* by Deepa Sinha and Ayushi Dhama *

* by Ramandeep Behl and V. Kanwar *

**New properties of Sharma - Kaushik partitions **
* by Bhu Dev Sharma and Norris Sookoo *

* by Himani Arora and Janak Raj Sharma *

**An Adaptive Network-based Fuzzy Inference System for the prediction of stock market: BSE30 and IBOVESPA
**

*by Gurbinder Kaur, Rangan K. Guha and Joydip Dhar*

**On the Class of U-Statistics Based Two-Sample Test for Location**
* by Narinder Kumar and Bhargab Chattopadhyay *

**A Refinement Of The Gruss Inequality For Positive Linear Functionals**
* by R. Sharma and A. Thakur *

**Partial Skew Group Semirings **
* by Ram Parkash Sharma, Anu and Rajni Parmar *

**A Characterization Of Rough Ideals in a Ring**
* by V. Selvan and G. Senthilkumar *

### Volume 37 (2012)

#### Volume 37 (2012) Issue 2-4 Comb. , (April-2012 to December-2012)

April-December

**SIGNED GRAPHS AND GEOMETRY **
* by THOMASZAS LAVSKY *

**SET-VALUATIONS OF A SIGNED DIGRAPH **
* by B. D. ACHARYA *

**UNIFORM DISTANCE-COMPATIBLE SET-LABELINGS OF GRAPHS **
* by K.A. GERMINA *

**SIGNED DEGREE SEQUENCES IN SIGNED GRAPHS **
* by S. PIRZADA *

**BALANCE IN CERTAIN GAIN GRAPH PRODUCTS **
* by SHAHUL HAMEEDK AND K.A. GERMINA *

**SOME NEW RESULTS ON SET-GRACEFUL AND SET SEQUENTIAL GRAPHS **
* by B. D. ACHARYA, K.A. GERMINA, KUMARABHISHEK, ANDP. J. SLATER *

**QUASICOSPECTRALITY OF GRAPHS AND DIGRAPHS: A CREATIVE REVIEW **
* by MUKTI ACHARYA *

**A CREATIVE REVIEW ON DISTANCE PATTERN DISTINGUISHING SETS IN A GRAPH **
* by GERMINA K.A. AND SONA JOSE *

**ON GRACEFULLY TOPOGENIC GRAPHS **
* by JISHA ELIZABATH JOY AND GERMINA K. A. *

**A CREATIVE SURVEY ON COMPLEMENTARY DISTANCE PATTERN UNIFORM SETS OF VERTICES IN A GRAPH
**

*by B. D. ACHARYA, GERMINA K.A. ANDBEENAKOSHY*

**TOPOLOGICALLY SET-GRACEFUL GRAPHS **
* by B. D. ACHARYA, GERMINA K.A., K.L. PRINCY AND S.B. RAO *

**HYPERGRAPHS OF MINIMAL ARC BASES IN A DIGRAPH **
* by B. D. ACHARYA, KUMAR ABHISHEK AND K.A. GERMINA *

**MINUS DOMINATION IN A SIGNED GRAPH **
* by B. D. ACHARYA *

**INTEGER ADDITIVE SET-INDEXERS OF A GRAPH: SUM SQUARE GRAPHS **
* by GERMINAK.A. AND T.M.K. ANANDAVALLY *

**ON ADJACENCY MATRICES AND DESCRIPTORS OF SIGNED CYCLE GRAPHS **
* by A.M. MATHAI AND THOMASZASLAVSKY *

**DIRECTIONALLY 2-SIGNED AND BIDIRECTED GRAPHS **
* by E. SAMPATHKUMAR, M. A. SRIRAJ AND THOMAS ZASLAVSKY *

**Preface**
* by E. SAMPATHKUMAR, M. A. SRIRAJ AND THOMAS ZASLAVSKY *

#### Volume 37 (2012) Issue 1 , (January-2012 to March-2012)

January-March

**Information Measures of Fuzzy Matrix and Fuzzy Binary Relation**
* by D.S.Hooda and Divya Jain *

**Cost Benefit Analysis of a Two Non-Identical Unit Standby System with Preventive Maintenance**
* by Rakesh Gupta, Ram Kishan and Dharmendra Kumar *

**Optimality and Duality for Multiobjective Fractional programming Involving ?-semilocally B-Prienvex Type-I Functions**
* by Raman Patel *

* by Seema Rani and Vinod Tyagi *

**On Estimation of Population Mean Using Regression Approach with Known Coefficient of Variation**
* by Sheela Misra, R. Karan Singh and Archana Shukla *

**On the Estrada Index of Ramanujan Graphs**
* by Yilun Shang *

**Adversary Degree Associated Reconstruction Number of Graphs Obtained from Complete Graphs or Cycles**
* by S.Sundar Raj and S. Monikandan *

### Volume 36 (2011)

#### Volume 36 (2011) Issue 1-4 Comb , (January-2011 to December-2011)

January-December

**Estimating Parameters of the Selected Inverse Gaussian Distribution- A Simulation Study**
* by Aditi Kar Gangopadhyay and Somesh Kumar *

** Testing a Composite Hypothesis of Equivalence when Normal Populations are Correlated**

*by Hubert J. Chen, Pei-Chi Shao and Li-Wei You*

**High-dimensional Asymptotic Distribution of Test Statistic for Multivariate Linear Hypothesis in Random-coefficient Model**
* by Tetsuro Sakurai, Masataka Igeta and Yasunori Fujikoshi *

**Confidence Regions of Functions of Parameters in a Nonlinear Repeated Measurement Model with Mixed Effects**
* by Mami Sako and Hiroto Hyakutake *

**Simultaneous Estimation of Quantiles of Normal Populations with Ordered Means**
* by Manas Ranjan Tripathy and Somesh Kumar *

**Estimating Bias in Similarity Measures for the Pareto Populations**
* by Madhuri S. Mulekar and Takeshi Fukasawa *

**Reliability under Random Operating Environment: Frailty Models**
* by Nitin Gupta, Ishwari D. Dhariyal and Neeraj Misra *

**A General Class of Subset Selection Procedures**
* by Narinder Kumar *

**A Fast Fractal Image Compression Algorithm Based on a Simple Similarity Measure**
* by Aydin Ozturk and Cengiz Gungor *

**On the Distribution of Sample Measure of Multivariate Kurtosis**
* by Takashi Seo and Mayumi Ariga *

**Selecting the Best Predictor: Numerical Explorations & Conjectures**
* by John S. Ramberg and Xiaoyu Huang *

**Second-Order Asymptotics of a Fine-Tuned Unbalanced Purely Sequential Procedure for the Partition Problem**
* by Tumulesh K. S. Solanky *

**A Chat with Dr. E. J. Dudewicz**
* by Madhuri S. Mulekar *

**Nonparametric Multiple Comparisons with more than One Control for Scale Parameters using Two Sample Statistics**
* by Amar Nath Gill, Vishal Maurya and Parminder Singh *

**Fitting Data and Distributions with the GLD and Kappa Distributions using Percentiles and L-Moments**
* by Zaven A. Karian and Edward J. Dudewicz *

### Volume 35 (2010)

#### Volume 35 (2010) Issue 3-4 Comb , (July-2010 to December-2010)

July-December

**The Cycle-Complete Graph Ramsey Number r(C7, K7) **
* by AMM Baniabedalruhman and MMM Jaradat *

** Fuzzy Ideals Of Group Graded Semirings**

*by Ram Prakash Sharma and Rosy Joseph*

** Separation Axioms For Generalized Fuzzy Topologies**

*by Ratna Dev Sarma, A. Sharfuddin and Anubha Bhargava*

** On higher order nonlinearity of Monomial Partial Spreads type Boolean functions**

*by Ruchi (Telang) Gode and Sugata Gangopadhyay*

** F - Compact Linear Operators on a Fuzzy Normed Linear Space**

*by Felbin C. Kennedy*

** Availability Analysis for Summer Air Conditioner with Pre-Emptive Resume Repair**

*by Deepankar Sharma and Surabhi Agarwal*

**Computation of Various Reliability Parameters of A Summer Air conditioning System by Using Boolean Function Expansion Algorithm**

*by C.K.Goel, Deepankar Sharma and Vinit Kumar Sharma*

** Preservance Topology and Compex Set Theory**

*by Richa Gupta and K.S. Venkatesh*

**Set Theory and the Composition of Processors**

*by Richa Gupta and K.S. Venkatesh*

**Combinatorial Non-Existence, Block Structure Properties and Applications of NML and Pseudo NMLMm(m) Type Designs**

*by Davinder Kumar Garg*

** On Study, Comparison and Implementation of Fuzzy Algorithm on Iris Data Set**

*by Kaushal Kishore Sharma, Rakesh Kumar Bajaj and Ravindra Bhatt*

** On Some Kantorovich Type Inequalities and their Applications**

*by R. Sharma and R. Bhandari*

** On Gracefulness of Graphs Obtained from Hairy Cycles**

*by Prabhakar Pradhan, Ajay Kumar and Debdas Mishra*

**Prime Correspondence Between a Semiring R and Its G −Fixed Semiring RG**

*by Ram Prakash Sharma and Madhu*

** Beyond the Method of Infinite Descent**

*by Susil Kumar Jena*

** Bounds On Two Generalized Cost Measures **

*by D.S.Hooda and D.K.Sharma*

** Congestion-sum Problem of Petersen Graphs into Complete Binary Trees**

*by Paul Manuel, Indra Rajasingh, Jasintha Quadras and Bharati Rajan*

#### Volume 35 (2010) Issue 1-2 Comb , (January-2010 to June-2010)

January - June

**Part I**

Various Unretractivities And Endotypes of Bipartite Graphs

*by Weimin Li*

**S - Alternate Error Correcting Linear Codes **

*by P K Das, Vinod Tyagi*

**Prime Graph of A Ring **

*by Nagaraju Dasari, Satyanarayana Bhavanari , Syam Prasad Kuncham*

**Stochastic Analysis of 2-Out of 3 Redundant System With Random Appearance And Disappearance of Repair Facility**

*by R K Bhardwaj , S Chander Malik*

**Mixed Type Duality For Multiobjective Fractional Variational Problems Involving (b,F,p) Convexity **

*by Raman Patel*

**Some More Results On The Norlund And Y Methods of Summability In Non-Archimedean Fields **

*by P.N. Natarajan*

**Balanced Perfect Sequences of Period 38 And 50**

*by K.T. Arasu, Zachary Little*

**A Ward Type Bound For Additive Divisible Codes Over Finite Abelian Groups And Its Application **

*by Xiaoyu Li*

**Part II**

Preface

The Boundary Element Method For Solving Dirichlet - Neumann Boundary Value Problems In 2D

*by Jan Zapletal, Jiri Bouchala*

**Application of Stochastic Catastrophe Theory To Reservoir Management **

*by Karuna Chauhan , Surender Kumar*

**The Legacy of General Relativity In The Third Millennium **

*by Mauro Francaviglia*

**Analysing The Customer Churn Risk Using Duration Models **

*by Rui Menezes, Sofia Portela*

**The Variational Bayes Method For Inverse Regression Problems With An Application To The Palaeoclimate Reconstruction **

*by Richa Vatsa, Simon Wilson*

**Parameter Estimation of Spatial Poisson Process In Domain With Unknown Boundary **

*by Patrice Marek , Tomas Toupal*

**Interlace Polynomials of Ladder Graphs **

*by Aihua Li, Qing Wu*

**Almost Optimal Trading Strategies For Small Transaction Costs And HARA Utility Function **

*by Petr Dostal*

### Volume 34 (2009)

#### Volume 34 (2009) Issue 1-4 , (January-2009 to December-2009)

January - December

**Highlights of Dijen Ray - Chaudhuri's Research **
* by Akos Seress *

**A Database of Z4 Codes**
* by Nuh Aydin, Tsvetan Asamov *

**On Extended Cyclic Codes, Reed-Muller Codes And Related Designs**
* by Andrew T. Azzam, David Clark, Vladimir D. Tonchev *

**A Conjecture On Linear Spaces of Prime Order**
* by Bhaskar Bagchi *

**On Antipodal Spherical t-Designs of Degree s With t>2s - 3**
* by Eiichi Bannai, Etsuko Bannai *

**Mass Formula For Self - Orthogonal Codes Over Zp2**
* by Akihiro Munemasa, Rowena Alma L.Betty *

**Commercial Applications of The Bose-Chaudhuri Error Correcting Codes**
* by Ms. Lily Banerjee, Probir K. Bondyopadhyay *

**On Apartments In Incidence Geometries**
* by Dimitri Leemans, Francis Buekenhout *

**Multiplicative Characterizations of Some Difference Sets In Elementary Abelian Groups **
* by Yu Qing Chen *

**Distributing Hash Families And Covering Arrays**
* by Charles J. Colbourn *

**Quaternary Sequences With The Shared Autocorrelation Property**
* by James A. Davis, Michael Pohi *

**APN Polynomials And Related Codes**
* by J.F. Dillon , K.A.Browining, M.T. McQuistan, R.E. Kibler *

**All q-ary Equidistant Codes of Distance 3**
* by Galina Bogdanova, Gyula O.H. Katona *

**Codes, Designs And Groups From The Hamming Graphs**
* by E. Mwambene, J.D. Key, W.Fish *

**Dominator Partitions of Graphs**
* by Alice A. Mc Rad, Charles K. Wallis, Renu Laskar, Sandra M. Hedetniemi, Stephen T. Hedetniemi *

**Difference Sets In Some Abelian Groups of Order 64**
* by S.L.Ma *

**Infinite Families of Candelabra Systems With Stem Size 2 And Steiner Designs**
* by Niranjan Balachandran *

**Consequences of The Multiplier Conjecture To The Existence of Hadamard Difference Sets**
* by Alexander Pott, Faruk GoloGlu *

**On The Maximal Clique Problem **
* by Nithya Sai Narayana , Sharad sane *

**Twisted Representation of Semiadditive Rings**
* by Navin Singhi *

**The Drinfel'd Polynomial of A Tridiagonal Pair**

*by Paul Terwilliger, Tatsuro Ito*

**Highlights of Dijen Ray-ChaudhuriÃ¢â‚¬â„¢s Research**
* by G. R. Vijaya kumar *

### Volume 33 (2008)

#### Volume 33 (2008) Issue 3-4 , (July-2008 to December-2008)

July-December

**On Tree-t-Spanners In Graphs **
* by J. Suresh Kumar , S. Arumugam *

**On N-Complete Invariance Property With Respect To Homeomorphism (n-Ciph)**
* by Gunjan Agrawal , Ruchi Tandon *

**On The Vectorial Eke Land's Variational Principle And Minimal Points In A Quasi Gauge Space **
* by Jessy Antony *

**Smooth Solutions For A Functional Equation Involving Series of Iterates **
* by P.V. Subrahmanyam, V. Murugan *

**A Randomized Approximation Algorithm For A Linear Control Design Problem **
* by Hemalatha T., Priyadarsini P.L.K., Ramakalyan A. *

**A Two-Unit Standby System With Correlated Failure And Repair Times, Random Check of Standby And Allowed Down Time **
* by Alka Chaudhary , Gaurav Varshney, Somendra Kumar Naresh *

**Compact Finite Difference Schemes To Simulate Unsteady Phenomena **
* by N. Sekarapandian , S. Vengadesan, Y.V.S.S. Sanyasiraju *

**Tilings of Rectangles With Triangular - Tetrominoes **
* by D G Thomas, T. Kalyani , V.R. Dare *

**On Association of Graph Splicing And Petri Net Splicing **
* by D G Thomas, K. Rangarajan, N.G. David, S. Kannamma *

**On Intrinsic Ambiguity of Internal Contextual Languages**
* by K. Lakshmanan *

**3D Pattern Generation With Array Contextual Grammars **
* by K. Krithivasan, M.V. Padmavati , Sunita Soni *

**Some Combinatorial Results On Bernoulli Sets And Pcodes **
* by D G Thomas, K. Sasikala, V.R. Dare *

**Inference of Regular Expressions From A Set of Strings Using A Pattern Automaton **
* by Kamala Krithivasan, Neetha Sebastian *

**Ambiguity In Insertion Deletion Kolam Array Grammars **
* by Kamala Krithivasan, M.B. Siddhartha *

**Ambiguity In Insertion Deletion Kolam Array Grammars **
* by K. Krithivasan , M.B. Siddhartha *

**Multisets And Petri Nets : An Overview **
* by Manfred Kudlek *

**Some Interseting Applications of Two-Norms Spaces **
* by P.K. Subramanian *

**On A General Solution of A Quartic Functional Equations **
* by K. Ravi *

**Applications of Wavelets In Digital Image Watermaking **
* by Kalyan Kothinti, Kamesh Namuduri , S.N. Narahari Pandit, Vyaghreswara Rao Namuduri *

**A New Parallel RK-Fifth Order Algorithm For Time Varying Network And First Order Intital Value Problems**
* by K. Ponnammal , R. Ponalagusamy *

**Global Existence Results For Implusive Differential Equations **
* by E. Thandapani , V. Muthulakshmi *

**Reconstruction of #d-Bi-Level Image From Three Projections With Periodicity Constraints **
* by K. Krithivasan, V. Masilamani *

**Partitioned Product of Matrices And Construction of Efficient Product Codes **
* by Bhu Dev Sharma *

**A Hawk Dove Game In Kleptoparasitic Populations **
* by Jan Rychtar, Mark Broom, Roger M. Luther *

#### Volume 33 (2008) Issue 1-2 , (January-2008 to June-2008)

January-June

**A New Fuzzy Mixed Metric Approach For Routing Decisions In Packet Switched Networks And Its Comparative Evaluation **
* by Mini Sharma , Shuchita Upadhayay *

**Kernel In Petersen Graphs **
* by Bharati Rajan , Indra Rajasingh , Joice Punitha, Paul Manuel *

**Augmented Butterfly Network**
* by Bharati Rajan , Indra Rajasingh , Paul Manuel , Prabha R *

**On Harmonious Colouring of Line Graph of Central Graphs of Bipartite Graphs **
* by Anitha B, J.K. Thilagavathi, Vernold Vivin *

**Fuzzy Subsemigroups And Fuzzy Ideals of Semirings **
* by J.R. Gupta, Ram Prakash Sharma, Tilak Raj Sharma *

**Finite Dimentional Fuzzy Normed Line Space - III**
* by Felbin C. Kennedy *

**On Y-Locally Closed Sets And Mappings **
* by M. Lellis Thivagar, M. Margaret Nirmala, R. Raja Rajeswari *

**Iteration Product of Norlund Methods In Non-Archimedean Fields **
* by P.N. Natarajan , V. Srinivasan *

**Traffic Flow At Signalised Intersection **
* by Dr. Felbin C. Kennedy , Dr. Mercy Soruparani *

**Convolution of Generalized Norlund Methods For Double Sequences In Non-Archimedean Fields **
* by P.N. Natarajan , S. Sakthivel *

**Certain Subordination Results Involving Meromorphic Functions **
* by A. Singaravelu , C. Ramachandran , S. Sivasubramanian , T.N. Shanmugam *

**Certain Subordination Results Involving Meromorphic Functions **
* by A. Singaravelu , C. Ramachandran , S. Sivasubramanian , T.N. Shanmugam *

**Group Action On Fuzzy Ideals of Semirings **
* by Ram Prakash Sharma, Tilak Raj Sharma *

**IFT Spaces **
* by S. Muralikrishnan, V. Lakshmana Gomathi Nayagam *

**Some Results On certain Summability Methods In Non-Archimedean Fields **
* by P.N. Natarajan *

### Volume 32 (2007)

#### Volume 32 (2007) Issue 1-4 , (January-2007 to December-2007)

January - December

**The Bounds of Certain Sums Involving The Degrees of A Graph**

*by Feng-Zhen Zhao, Ting Chen*

**Linear Combination of Two U-Statistics For Testing New Better Than Used **

*by M P Anuradha, Parameshwar V Pandit*

**Complete Sets of Sums of Square Orthogonal F-Rectangular Arrays **

*by Walter T. Federer*

**Maximum Area Converses of Harary-Harborth Polyform Theorems**

*by Robert R. Meyer, Winston C. Yang*

**An Inventory Model With Inventory Level Dependent Demand Rate, Shortages And Decrease In Demand **

*by Mukesh Kumar, Sanjay Jain*

**Optimum Mixture Design Via Equivalence Theory **

*by Manisha Pal, Nripes Kumar Mandal*

**A Two Identical Unit Parallel System With Geometric Failure And Repair Time Distributions **

*by Gaurav Varshney, Rakesh Gupta*

**A Class of Best Linear Unbiased Estimators (BLUE) For A Class of Super-Population Models **

*by R. Karan Singh, Sheela Misra*

**Stochastic Analysis of Threshold Effect On The Onset of Terrorim **

*by Surender Kumar, Usha Sharma*

**Reliability And M.t.t.f. Evaluation of A Withdrawal Unit of Continuous Slab Caster System In Steel Plants **

*by C K Goel , Deepankar Sharma, Vinit Kumar Sharma*

**Histories of Iterated Path Graphs**

*by Yaser Jumah Al-Mtawa*

**Optimality And Duality For Multiobjective Fractional Variational Control Problems Involving (b.F,p)-Type 1 Functions**

*by Raman Patel*

**Reliability Analysis of A Single Unit M/G/I System Model With Helping Unit**

*by Praween Kumar, Rakesh Gupta*

**Harmonious Chromatic Number of Central Graph of Complete Graph Families **

*by Akbar Ali M.M., Vernold Vivin J.*

**On Harmonious Colouring of Line Graph of Central Graphs of Bipartite Graphs**

*by Anitha B., J K Thilagavathi, Vernold Vivin*

**A Two Non-Identical Unit Standby System With Correlated Working And Rest Time Of Repairman **

*by Rakesh Gupta, Vishal Sharma*

**Hyers Ulam Rassias Stability of Generalised Quartic Functional Equation **

*by K. Ravi , R. Murali*

**Robustness And Efficiency of Some Tests For Testing Main Effects In A Randomised Block Design **

*by Bipin Gogoi , Ms. Kunja Deka*

**Permanents And Graphs **

*by K. Somasundaram, S. Maria Arul Raj*

**Group Divisible Designs With Two Groups And Block Configuration (1,4)**

*by Dinesh G. Sarvate, Spencer P. Hurd*

### Volume 31 (2006)

#### Volume 31 (2006) Issue 1-4 , (January-2006 to December-2006)

January - December

**Smooth Estimation of Uniformly Stochastically Ordered Survival Functions **

*by Subhash C. Kochar, Yogendra P. Chaubey*

**Randomization of Row-Column Designs With Non-Orthogonal Row Vs Column Classification **

*by Sudhir Gupta*

**The Exact And Near - Exact Distributions of The Product of Independent Beta Random Variables Whose Second Parameter is Rational **

*by Carlos A. Coelho*

**Certain T-Partite Graphs**

*by Moon Ho Lee, R N Mohan , Subash Pokherl*

**Difference Equations And Hamming Codes**

*by Bal Kishan Dass, Pranav Dass, Stefano Innamorati*

** An Improved Version of Christofides Randomized Response Technique For Complex Surveys**

*by Amitava Saha*

**Rate of Convergence For Baskakow Type Operators On Functions of Bounded Variation **

*by NK Govil, Vijay Gupta*

**Present Value Formulation of Order _ Level Lot - Size Model For Time Dependant Rate of Deteriorating Items With Stock Dependent Demand Under Permissible Delay In Payments **

*by Bhavin J. Shah, Nita H. Shah, Y.K. Shah*

**Modelling Pest Incidence - A Nonparametric Approach **

*by Pradip Kumar Sahu , Sanpei Kageyama, Satyabrata Pal, Satyananda Basak , Subhabaha Pal , Sunil Kumar Ghosh*

**Busy Period Density of Queuing System C/ M/I**

*by Bidisha Borkakaty, Kanwer Sen, Manju Agarwal*

**Computer Aided Search of Efficient Nested Incomplete Block Designs For Correlated Observations **

*by A K Nigam , Rajender Prasad, Subrata Kumar Satpati, V K Gupta*

**Structure of Karhunen Processes **

*by M M Rao, Subrata Kumar Satpati*

**Note On An Additive Characterization of Quadratic Residues Modulo p**

*by Chris Monico, Michele Elia*

**Modelling And Forecasting of Bilinear Time-Series Using Frequency Domain Approach **

*by G. Sunil Kumar , Himadri Ghosh , Prajneshu*

**Comparing Lenth's And Three Iterative Step-Down Tests : A Power Study **

*by Daniel T. Vass, Jiangnan Zhao*

**Hyperstructures Associated With Fuzzy Sets Endowed With Two Membership Functions **

*by Piergiulio Corsini*

**Exact Heteroscedastic Discriminant Analysis With Tables Case of k=2 Univariate Populations **

*by Eward J. Dudewicz, Zaven A. Karian*

**Few Steiner Systems S93,k,v) Are KDPs**

*by Luigia Beradi, Stefania Ferri*

**Selecting A Subset Containing The Best Negative Binomial Population **

*by N S Barlett, Z. Govindarajulu*

**On Dual To Ratio Type Estimators of Population Mean Using Transformed Auxiliary Variable **

*by Javid Shabbir, Sat Gupta*

**On Instantaneous Codes**

*by Navin M Singhi, Stephan Folders*

**In Equalities For The Polar Derivative of A Polynomial **

*by Barchand Singh, K K Dewan*

**A Simple Approach To Birth Proccesses With Random Catastrophes**

*by J. Gani , R.J. Swift*

**A New Method of Constructions of (r,) - Designs Using Codes**

*by M L Aggarwal , Seema Gupta*

**Refinement of Inequalities Among Means**

*by Inder Jet Taneja*

** Foods Drugs And Clinical Trials : Some Outrageous Issues**

*by Jagdish N. Srivastava*

Manuscript Submission Submission of a manuscript implies: that the work described has not been published before; that it is not under consideration for publication anywhere else; that its publication has been approved by all co-authors, if any, as well as by the responsible authorities – tacitly or explicitly – at the institute where the work has been carried out.

Manuscripts written in English may be submitted in triplicate to an Editorial Board member or the Chief Editor:

Prof. Bhu Dev Sharma,

Former Prof. of Mathematics,

SA-704, Gulmohar Towers,

6/25, Chiranjiv Vihar, Ghaziabad,

U.P.-201002 (India)

E-mail: sharmaforum@yahoo.com

The cover letter should include a written statement from the author(s) that:

1. The manuscript is an original research work and has not been published elsewhere, including open access at the internet.

2. The data used in the research has not been manipulated, fabricated, or in any other way misrepresented to support the conclusions.

3. No part of the text of the manuscript has been plagiarised.

4. The manuscript is not under consideration for publication elsewhere.

5. The manuscript will not be submitted elsewhere for review while still under consideration for publication in the JCISS.

The cover letter should also include an ethical statement disclosing any conflict of interest that may directly or indirectly impart bias to the research work. Conflict of interest most commonly arises from the source of funding, and therefore, the name(s) of the funding agency must be mentioned in the cover letter.

In case of no conflict of interest, please include the statement that “the authors declare that they have no conflict of interest.”

General Guidelines

Manuscripts should be prepared to confirm the accepted standards of international journals. The following points must be noted before sending the manuscript:

1. Manuscripts should be compiled in the following order: title page; abstract; keywords; main text introduction, materials and methods, results, discussion; acknowledgments; declaration of interest statement; references.

2. The first page of the manuscript should contain

(i) the title; (ii) the name(s) and institutional affiliation(s) of the author(s); (iii) an abstract of not more than 100 words; and (iv) a footnote giving the name and present address of the author to whom proofs and reprint order form should be addressed.

3. References at the end of the manuscript should be arranged in alphabetical order of the first letter of the surname and should be styled and punctuated according to the following examples.

[1] D.K. Ray-Chaudhury, N.M. Singhi and G.R. Vijay Kumar (1992), “Signed graphs having least eigenvalue around 2”, Jr. Comb. Inf. & Syst. Sci., 17 (to appear).

[2] H. Quastler, ed. (1955), Information Theory in Psychology, The Free Press, Glencoe.

[3] C.E. Shannon (1959), “Probability of error for optimal codes in a Gaussian channel,” Bell System Tech. J., 38, 611-655.

The journal is committed to maintaining the highest level of integrity in the content published.

This journal has a Conflict-of-Interest policy in place.

The journal may use plagiarism detection software to screen the submissions. If plagiarism is identified, then the paper will be rejected without any review process.

Content published in this journal is peer-reviewed (Single Blind).

### Introduction

FIRST CALL FOR SUBMISSIONS :

COMPUTATIONAL MATHEMATICS

The Forum for Interdisciplinary Mathematics [FIM] is a registered trust in India. It is an India based international society of scholars working in Mathematical Sciences and related areas. The society was incepted in 1975 by a group of Delhi University intellectuals led by Prof. Bhu Dev Sharma. The Forum has been conducting international conferences in India and abroad The Journal of Combinatorics, Information and System Sciences [JCISS] is a quarterly publication of the FIM, that began publication 1976.### Topics

JCISS is calling for original research submissions for the November 2019 Special Theme issue on

COMPUTATIONAL MATHEMATICS.

Important Dates: Last date of submission: 15 October 2019 Notification of acceptance: 15 November 2019

Instructions to Authors:

https://www.printspublications.com/journal/journalofcombinatoricsinformationsystemsciencesaquarte rlyinternationalscientificjournal16632080702246932604Manuscripts may please be sent only to The Guest Editors mentioned in this Call for Submissions or to the Chief Editor, JCISS.

Guest Editors:

1.) Prof. T V Gopal: gopal.tadepalli@gmail.com

Computer Science and Engineering, Anna University, Chennai2.) Prof. Junzo Watada: junzo.watada@gmail.com

Emeritus Professor, Waseda University, Japan3.) Prof. P V Subrahmanyam: iitmpvs@hotmail.com

(Retd). Head, Department of Mathematics, IIT Madras & IIT Hyderabad4.) Dr. Antony Vijesh: antonyvijesh@gmail.com

Associate Professor of Mathematics, IIT Madras### Subject Covered

Scope of the Special Theme:

a.) Implications of finite precision arithmetic b.) Efficiency, accuracy, and stability of numerical computations c.) Development and maintenance of mathematical software d.) Effects of modern developments in computer architectures and networksSuggested Topics [Not Limited to]:

1.) Asymptotics, analysis, numerical analysis, and signal processing 2.) Discrete mathematics, combinatorics, algorithms, computation geometry, and graphics 3.) Mechanics and field theories 4.) Optimization 5.) Partial and ordinary differential equations 6.) Stochastic modeling, probability, statistics, and information theory 7.) Mathematical analysis, algebra, numerics, differential equations and cryptography### Instructions to Authors

### Submit Your Article

sharmaforum@yahoo.com ; gopal.tadepalli@gmail.com ; junzo.watada@gmail.com ; iitmpvs@hotmail.com ; antonyvijesh@gmail.com

### Frequency

4 issues per year.