Parameterized Problems Related to Seidel''s Switching
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10100314" target="_blank" >RIV/00216208:11320/11:10100314 - isvavai.cz</a>
Alternative codes found
RIV/00216224:14330/11:00053105
Result on the web
<a href="http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1531" target="_blank" >http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1531</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Parameterized Problems Related to Seidel''s Switching
Original language description
Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching-equivalent if one can be made isomorphic to the other by a sequence of switches. In this paper, we continue the study of computational complexity aspects of Seidel's switching, concentrating on Fixed Parameter Complexity. Among other results we show that switching to a graph with at mostk edges, to a graph of maximum degree at most k, to a k-regular graph, or to a graph with minimum degree at least k are fixed parameter tractable problems, where k is the parameter. On the other hand, switching to a graph that contains a given fixed graph as an induced subgraph is W [1]-complete. We also show the NP-completeness of switching to a graph with a clique of linear size, and of switching to a graph with small number of edges.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Discrete Mathematics and Theoretical Computer Science
ISSN
1365-8050
e-ISSN
—
Volume of the periodical
13
Issue of the periodical within the volume
2
Country of publishing house
FR - FRANCE
Number of pages
24
Pages from-to
19-42
UT code for WoS article
000290721600002
EID of the result in the Scopus database
—