Zobrazeno 1 - 10
of 92
pro vyhledávání: '"Paul, Sanchita"'
Let $G=(V,E)$ be a connected graph and $d_{G}(u,v)$ be the shortest distance between the vertices $u$ and $v$ in $G$. A set $S=\{s_{1},s_{2},\cdots,s_{n}\}\subset V(G)$ is said to be a {\em resolving set} if for all distinct vertices $u,v$ of $G$, th
Externí odkaz:
http://arxiv.org/abs/2401.00705
Publikováno v:
Aslib Journal of Information Management, 2023, Vol. 76, Issue 6, pp. 938-973.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/AJIM-10-2022-0468
Graph burning is a graph process that models the spread of social contagion. Initially, all the vertices of a graph $G$ are unburnt. At each step, an unburnt vertex is put on fire and the fire from burnt vertices of the previous step spreads to their
Externí odkaz:
http://arxiv.org/abs/2308.02825
Autor:
Bala, Kanchan1 (AUTHOR), Paul, Sanchita1 (AUTHOR), Mohanty, Sachi Nandan2 (AUTHOR) Sachinandan09@gmail.com, Mahapatra, Satyasundara3 (AUTHOR)
Publikováno v:
New Generation Computing. Mar2024, Vol. 42 Issue 1, p7-31. 25p.
Catch digraphs was introduced by Hiroshi Maehara in 1984 as an analog of intersection graphs where a family of pointed sets represents a digraph. After that Prisner continued his research particularly on interval catch digraphs by characterizing them
Externí odkaz:
http://arxiv.org/abs/2010.08664
Autor:
Paul, Sanchita
Max-point-tolerance graphs (MPTG) was introduced by Catanzaro et al. in 2017 as a generalization of interval graphs. This graph class has many practical applications in study of human genome as well as in signal processing for networks. The same clas
Externí odkaz:
http://arxiv.org/abs/2002.01349
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Paul, Sanchita, Ghosh, Shamik
Max-point-tolerance graphs (MPTG) were studied by Catanzaro et al. in 2017 and the same class of graphs were introduced in the name of p-BOX(1) graphs by Soto and Caro in 2015. In our paper we consider central-max-point tolerance graphs (central MPTG
Externí odkaz:
http://arxiv.org/abs/1712.00008
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.