Zobrazeno 1 - 10
of 2 005
pro vyhledávání: '"DAS, ASHOK"'
E-governance is a two-way protocol through which one can use government services, share data and request information. It refers to the use of communication and information technologies to provide government services to public in an efficient and fast
Externí odkaz:
http://arxiv.org/abs/2407.13318
Autor:
Paul, Indrajit, Das, Ashok Kumar
Graph powers are a well-studied concept in graph theory. Analogous to graph powers, Chandran et al.[3] introduced the concept of bipartite powers for bipartite graphs. In this paper, we will demonstrate that some well-known classes of bipartite graph
Externí odkaz:
http://arxiv.org/abs/2404.17279
Autor:
Das, Ashok Kumar, Paul, Indrajit
Threshold tolerance graphs and their complement graphs, known as co-TT graphs, were introduced by Monma, Reed, and Trotter[24]. Building on this, Hell et al.[19] introduced the concept of negative interval. Then they proceeded to define signedinterva
Externí odkaz:
http://arxiv.org/abs/2308.12614
Autor:
Narayan, KG Raghavendra, Mookherji, Srijanee, Odelu, Vanga, Prasath, Rajendra, Turlapaty, Anish Chand, Das, Ashok Kumar
With rapid technological growth, security attacks are drastically increasing. In many crucial Internet-of-Things (IoT) applications such as healthcare and defense, the early detection of security attacks plays a significant role in protecting huge re
Externí odkaz:
http://arxiv.org/abs/2308.00943
Autor:
Das, Ashok Kumar, Paul, Indrajit
A class of graphs $\mathcal{C}$ is closed under powers if for every graph $G\in\mathcal{C}$ and every $k\in\mathbb{N}$, $G^k\in\mathcal{C}$. Also $\mathcal{C}$ is strongly closed under powers if for every $k\in\mathbb{N}$, if $G^k\in\mathcal{C}$, the
Externí odkaz:
http://arxiv.org/abs/2210.08782
Autor:
Das, Ashok Kumar, Paul, Indrajit
In this paper, we define and characterize signed interval graphs and bigraphs introducing the concept of negative interval. Also we have shown that these classes of graphs are respectively a generalization of well known classes of interval graphs and
Externí odkaz:
http://arxiv.org/abs/2206.05917
Autor:
Das, Ashok Kumar, Paul, Indrajit
A graph $G$ is Hamiltonian-connected if there exists a Hamiltonian path between any two vertices of $G$. It is known that if $G$ is 2-connected then the graph $G^2$ is Hamiltonian-connected. In this paper we prove that the square of every self-comple
Externí odkaz:
http://arxiv.org/abs/2206.02385