On the edit distance from \(K_{2,t}\)-free graphs (Q2922222)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the edit distance from \(K_{2,t}\)-free graphs |
scientific article; zbMATH DE number 6353348
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the edit distance from \(K_{2,t}\)-free graphs |
scientific article; zbMATH DE number 6353348 |
Statements
9 October 2014
0 references
edit distance
0 references
quadratic programing
0 references
strongly regular graphs
0 references
0 references
On the edit distance from \(K_{2,t}\)-free graphs (English)
0 references
Let \(\operatorname{Forb}(H)\) be the hereditary property that consists of the graphs with no induced copy of a single graph \(H\). In this paper, the entire edit distance functions for \(\operatorname{Forb}(K_{2,3})\) and \(\operatorname{Forb}(K_{2,4})\) are computed. Some upper bounds for the edit distance function of \(\operatorname{Forb}(K_{2,t})\) are derived.
0 references
