Trivially extendable graphs

MaRDI QIDQ2832241zbMATH OpenFDO

Authors K. Angaleeswari, P. Sumathi, Venkata Swaminathan

Publication date 10 November 2016

Published in TWMS Journal of Applied and Engineering Mathematics (Search for Journal in Brave)

zbMATH Keywords

extendable graphsindependence numbertrivially extendable graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 637274
• A note onn-extendable graphs
• scientific article; zbMATH DE number 2077671
• scientific article; zbMATH DE number 825129
• Well-covered graphs and extendability

Cited in

(5)

• Well-covered graphs and extendability
• 1-extendability of independent sets
• Uniquely edge extendible graphs
• scientific article; zbMATH DE number 736426 (Why is no real title available?)
• ON AN EXTENSION OF TRIVIALIZABLE GRAPHS

This page was built for publication: Trivially extendable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2832241)