Zobrazeno 1 - 10
of 268
pro vyhledávání: '"Sadagopan, N"'
Given a graph $G$ with a terminal set $R \subseteq V(G)$, the Steiner tree problem (STREE) asks for a set $S\subseteq V(G) \setminus R$ such that the graph induced on $S\cup R$ is connected. A split graph is a graph which can be partitioned into a cl
Externí odkaz:
http://arxiv.org/abs/2210.02288
The class of $k$-star caterpillar convex bipartite graphs generalizes the class of convex bipartite graphs. For a bipartite graph with partitions $X$ and $Y$, we associate a $k$-star caterpillar on $X$ such that for each vertex in $Y$, its neighborho
Externí odkaz:
http://arxiv.org/abs/2107.09382
A bipartite graph is chordal bipartite if every cycle of length at least six has a chord in it. M$\ddot{\rm u}$ller \cite {muller1996Hamiltonian} has shown that the Hamiltonian cycle problem is NP-complete on chordal bipartite graphs by presenting a
Externí odkaz:
http://arxiv.org/abs/2107.04798
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.
For a connected graph, the Hamiltonian cycle (path) is a simple cycle (path) that spans all the vertices in the graph. It is known from \cite{muller,garey} that HAMILTONIAN CYCLE (PATH) are NP-complete in general graphs and chordal bipartite graphs.
Externí odkaz:
http://arxiv.org/abs/1809.06113
Autor:
Harshita, Kona, Sadagopan, N.
The family of graphs that can be constructed from isolated vertices by disjoint union and graph join operations are called cographs. These graphs can be represented in a tree-like representation termed parse tree or cotree. In this paper, we study so
Externí odkaz:
http://arxiv.org/abs/1808.09117
Autor:
Renjith, P., Sadagopan, N.
In this paper, we investigate Hamiltonian path problem in the context of split graphs, and produce a dichotomy result on the complexity of the problem. Our main result is a deep investigation of the structure of $K_{1,4}$-free split graphs in the con
Externí odkaz:
http://arxiv.org/abs/1711.09262
A bipartite graph is chordal bipartite if every cycle of length at least 6 has a chord in it. In this paper, we investigate the structure of $P_5$-free chordal bipartite graphs and show that these graphs have a Nested Neighborhood Ordering, a special
Externí odkaz:
http://arxiv.org/abs/1711.07736
The focus of this paper is two fold. Firstly, we present a logical approach to graph modification problems such as minimum node deletion, edge deletion, edge augmentation problems by expressing them as an expression in first order (FO) logic. As a co
Externí odkaz:
http://arxiv.org/abs/1711.02889
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.