New bounds of induced acyclic graphoidal decomposition number of a graph

Title

New bounds of induced acyclic graphoidal decomposition number of a graph

Creator

Joseph M.; Sahul Hamid I.

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.

Source

Trends in Mathematics, pp. 595-601.

Date

2019-01-01

Publisher

Springer International Publishing

Coverage

Joseph M., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, India; Sahul Hamid I., Department of Mathematics, The Madura College, Madurai, India

Rights

Restricted Access

Relation

ISSN: 22970215

Format

Online

Language

English

Type

Book chapter

Identifier

https://doi.org/10.1007/978-3-030-01123-9_59

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85061323136&doi=10.1007%2f978-3-030-01123-9_59&partnerID=40&md5=c26e079690bdaf8062ee5e4d0a197987