Trivially extendable graphs
Trivially extendable graphs
A graph is \(k\)-extendable if every independent set of order \(k\) is contained in a maximum independent set. It is called trivially extendable if it is \(k\)-extendable only for \(k\) being equal the independence number. In this paper, trivially extendable graphs are described among the graphs \(G\) having the independence number equal \(|V(G)|-2\) and \(|V(G)|-3\), respectively.
- ISIK UNIVERSITY Turkey
Extensibility in graphs, Extremal problems in graph theory, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), trivially extendable graphs, extendable graphs, Trivially extendable graphs, Berge graph;Extensibility in graphs;Trivially extendable graphs, Berge graph, independence number
Extensibility in graphs, Extremal problems in graph theory, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), trivially extendable graphs, extendable graphs, Trivially extendable graphs, Berge graph;Extensibility in graphs;Trivially extendable graphs, Berge graph, independence number
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!