Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.
Negar Kheirkhahan, Jaber Ramezani Tousi, Masoud Ghods
In this paper: The primary use of topological indices (TIs) in chemical sciences lies in estimating the physical and chemical attributes of molecular graphs. The refractive, reflective, and transmission properties o...
Medha Itagi Huilgol, Grace Divya D’Souza, Ismail Naci Cangul
In this paper: In this paper, codes for Cartesian product of graphs such as Kt Ps and strong product of graphs such as Kt Ps using k-resolving sets are determined. We also obtain infinite families of Kt Ps and...
B. Gayathri, R. Gopi
In this paper: In this Paper we establish proved several properties related to k – EMG. Properties are very much useful for some cycle related graphs.
Zohreh Rajabinejad, Saeed Mohammadian Semnani
In this paper: The double-star line graph is a graph built from two complete graphs of order a+1 that share a common vertex, for every positive integer a ≥ 1. In this article, we investigate concepts of energy and e...
Tapas Chatterjee, Ayantika Laha
In this paper: In 2014, Gupta and Ray proved that the circulant involutory matrices over the finite field F2m can not be maximum distance separable (MDS). This non-existence also extends to circulant orthogonal matr...
Winson Rajaian, Kolappan Velayutham, Santhosh Moni, Sulaiman Nazarudeen
In this paper: The definition of b-coloring of a graph leads to the construction of what we call as Color Class Complete Graph (CCCG). We find the b-chromatic number of the p-petal graph, when p = 3, using the CCC G...
Mohammad Farhan, Peter John, Denny Riama Silaban
In this paper: Let Γ = (V, E) be a graph of order η with V = {1, 2, 3, …, η} and E ⊆ [V]2. The antiadjacency matrix of Γ is an η × η matrix where the ij-entry is 1 if ij ∉ E and 0 if otherwise. An antiadjacency matr...
V. Maheswari, A. Sagaya Rose Tucilin Mary, V. Balaji
In this paper: Graph labeling is an essential concept that aims to provide a unique illustration for labeled graphs so that complex networks are easier to grasp for a real-time application. This study deals with the...
N. Jothilakshmi, R. Sundara Rajan, Indra Rajasingh, D. Ahima Emilet
In this paper: The ability of one architecture to simulate another is the basis for comparing networks. Embedding is used to analyze these simulations. In architectural simulation, graph embedding is considered one...
G. Aishwarya, R. Sundara Rajan, T. M. Rajalaxmi, D. Ahima Emilet
In this paper: Among interconnection topologies, the hypercube is both popular and highly attractive, extensively used in parallel computing and network design due to its versatility and scalability. Its desirable p...
E. Santhanamari, G. Kavitha
In this paper: This research paper discusses the concept of interval type - 2 fuzzy rhotrix, by focusing its definitions, properties, and significant results. The study begins by defining interval type - 2 fuzzy rho...
P. Leo Joshwa, R. Sundara Rajan, T. M. Rajalaxmi, D. Ahima Emilet
In this paper: The Sierpińki network S(p, q) is a hierarchical, self-similar structure with broad applications in multiprocessor interconnection and VLSI design. In this work, we study its enhanced variant, S++ (p,...
Fatih Yılmaz, Samet Arpacı, Aybüke Ertaş, Mustapha Rachidi
In this paper: In this paper, we introduce a novel coding and decoding framework based on a generalized form of the k-order Jacobsthal polynomials. To this end, we first investigate the structure of these polynomial...
Mona Tarek, M. A. M. Sharaf, M. A. Seoud
In this paper: The purpose of this article is to establish a sub algebra of an almost distributive lattice ℜ by defining the Core of ℜ notated by ℑπ for any π ∈ ℜ. The features of ℑπ are investigated. Some propertie...
Siva Gunupuru, Umaprasada Rao Bodasingi, Avanigadda Jaya Venkata Radhika, Kalyan Kumar Palaparthi
In this paper: In recent years, there have been innovations in the realm of digital signatures, with extensions and variations that integrate digital signatures with specific protocols to provide additional function...
Mohamed Ayari, Zeineb Klai, Mohamed Ali Hammami
In this paper: This study presents a hybrid computational approach integrating Discrete Wavelet Transforms (DWT) with the Finite Element Method (FEM) to achieve adaptive mesh refinement and improve simulation effici...
A. Shenbaga Priya, R. Sundara Rajan, Indra Rajasingh, V. Govindan
In this paper: Given a graph denoted by G, a vertex cover refers to a selection S taken from the node set V(G) with the condition that every line in the edge set E(G) contains at least one of its endpoints within S....
G. Jessy Sujana, J. Anitha, T. M. Rajalaxmi
In this paper: To create independent edges in a graph G, this work presents a variant of the zero forcing set called the ‘edge-forcing set.’ A collection of vertices in G that can influence their neighbors to force...
V. Kamala Kannan, R. Sundara Rajan, T. M. Rajalaxmi, D. Ahima Emilet
In this paper: The study of graph burning is a crucial area in graph theory, providing insight into the spread of influence, information, or fire across networks. This paper investigates the burning number of triang...
Kritsanapong Somsuk
In this paper: Kyber is one of post quantum cryptography techniques that has been formally standardized by NIST. In fact, Kyber-512 exhibits the lowest security but achieves the fastest speed relative to other algor...
Ridho Alfarisi, Arika Indah Kristiana, Sharifah Kartini Said Husain
In this paper: In a graph G, the distance between any two vertices is defined as the length of the shortest path connecting them. A path in G is termed rainbow vertex-connected if all internal vertices along the pat...
Alzhan Tilenbayev, L. La Spada, N. Zeeshan, M. Bakyt, Sabyrzhan Atanov, Huseyin Canbolat, Shattyk Zh. Kanbayeva, B. Prmantayeva et al.
In this paper: This paper explores the synergistic integration of microprocessor-based intelligent cyber defence mechanisms with high-speed data encryption techniques for Low Earth Orbit (LEO) spacecraft. As LEO con...
Shatha Alghueiri, Khaldoun Al-Zoubi
In this paper: This study investigates the concept of gr-Pe-Jgr-PrySups as an extension of gr-Jgr-PrySub within the framework of Ω-graded commutative rings. Let Ω be a group with identity e, W = ⊕g∈Ω Wg a Ω-graded c...
Siripong Sirisuk, Songpon Sriwongsa
In this paper: An orthogonal inclusion graph is constructed from totally isotropic subspaces of an orthogonal space over a finite field of odd characteristic with a finite dimension. Its vertices correspond to all n...
D. Senthil Kumar, S. P. Lavanya, M. Sugasini
In this paper: Solairaju and Chithra [2] presented the concept of edge odd graceful labeling (EOGL) for finite simple graphs. A graph is said to be EOGL if such a labeling exists a bijective mapping a function f fro...
T. M. Rajalaxmi, P. B. Sailusha, Maahirah Samiullah, R. Arputhaselvi, C. Jenisha Christy
In this paper: In graph theory, there are many quantitative values that are usually graph invariant and one such invariant that characterizes the structure or topology of a graph is called as topological index. Wien...
Install Journal of Discrete Mathematical Sciences and CryptographyFaster access from your home screen
