New bounds of induced acyclic graphoidal decomposition number of a graph
description: An induced acyclic graphoidal decomposition (IAGD) of a graph G is a collection ? of nontrivial induced paths in G such that every edge of G lies in exactly one path of ? and no two paths in ? have a common internal vertex. The minimum cardinality of an IAGD of G is called the induced acyclic graphoidal decomposition number denoted by ? ia (G). In this paper we present bounds for ? ia (G) in terms of cut vertices and simplicial vertices of G. Springer Nature Switzerland AG 2019.
creator: Joseph M.; Sahul Hamid I.
source: Trends in Mathematics, pp. 595-601.
publisher: Springer International Publishing
date: 2019-01-01
rights: Restricted Access
relation: ISSN: 22970215
format: Online
language: English
type: Book chapter
coverage: Joseph M., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, India; Sahul Hamid I., Department of Mathematics, The Madura College, Madurai, India