On an extremal inverse problem in graph theory

DOI10.1134/S1990478915020027zbMath1349.05254MaRDI QIDQ3186815

Aleksandr B. Dainyak, Artem Dmitrievich Kurnosov

Publication date: 12 August 2016

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

zbMATH Keywords

inverse problembipartite graphindependent set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

The set of all values of the domination number in trees with a given degree sequence

Cites Work

• Unnamed Item
• The inverse problem for certain tree parameters
• Bipartite graphs can have any number of independent sets
• A class of trees and its Wiener index
• All but 49 numbers are Wiener indices of trees
• A remark on the existence of finite graphs

This page was built for publication: On an extremal inverse problem in graph theory