[HTML][HTML] A survey of parameterized algorithms and the complexity of edge modification
The survey is a comprehensive overview of the develo** area of parameterized
algorithms for graph modification problems. It describes state of the art in kernelization …
algorithms for graph modification problems. It describes state of the art in kernelization …
Subgraph complementation
A subgraph complement of the graph G is a graph obtained from G by complementing all the
edges in one of its induced subgraphs. We study the following algorithmic question: for a …
edges in one of its induced subgraphs. We study the following algorithmic question: for a …
Distance energy of partial complementary graph
The partial complement of a graph G with respect to a set S is the graph obtained from G by
removing the edges of induced subgraph< Si> and adding edges which are not in< Si> of G …
removing the edges of induced subgraph< Si> and adding edges which are not in< Si> of G …
[PDF][PDF] Energy of Partial Complement of a Graph with Self-loops
SDS Amrithalakshmi, S Nayak - researchgate.net
The purpose of this paper is to extend the concept of energy of a graph with self-loops to
partial complement of a graph. The partial complement of a graph G with respect to a set S …
partial complement of a graph. The partial complement of a graph G with respect to a set S …
[PDF][PDF] Graph Editing by Partial Complements
TR Scholte - research.tue.nl
The partial complement, introduced by Kaminski, Lozin, and Milanic [18], is a graph
operator, that given a subset of the vertices, complements the subgraph induced on those …
operator, that given a subset of the vertices, complements the subgraph induced on those …