On k-Ended Spanning and Dominating Trees

Zhora G. Nikoghosyan

Download

Title: On k-Ended Spanning and Dominating Trees

Volume:

ISSN:

0131-4645

Additional Information:

click here to follow the link

Coverage:

26-31

Abstract:

A tree with at most k leaves is called a k-ended tree. Let tk be the order of a largest k-ended tree in a graph. A tree T of a graph G is said to be dominating if V (G-T) is an independent set of vertices.

Publisher:

Изд-во НАН РА

Date created:

2015-02-19

Format:

pdf

Identifier:

oai:arar.sci.am:258832

Location of original object:

ՀՀ ԳԱԱ Հիմնարար գիտական գրադարան

Subject and keywords:

Mathematics Graph theory Hamilton cycle Hamilton path Dominating cycle Dominating path Longest path k-ended tree.

Object collections:

Digital Library > Articles

Last modified:

Aug 18, 2025

In our library since:

Jul 24, 2020

Number of object content hits:

All available object's versions:

https://arar.sci.am/publication/281954

Show description in RDF format:

RDF

Show description in OAI-PMH format:

OAI-PMH

ՀՀ ԳԱԱ Շարունակական հրատարակություններ

Edition name	Date
On k-Ended Spanning and Dominating Trees	Aug 18, 2025

Object

Title: On k-Ended Spanning and Dominating Trees

Creator:

Type:

Journal or Publication Title:

Date of publication: