19The Pendant Number of Some Graph Products

Jomon K Sebastian

Savio HSS,Devagiri, Kozhikode,Kerala (INDIA),E-mail: jomoncmi@gmail.com

Sudev Naduvath

Department of Mathematics,CHRIST (Deemed to be University),Bengaluru (INDIA). E-mail: sudev.nk@christuniversity.in

Joseph Varghese Kureethara

Department of Mathematics,CHRIST (Deemed to be University),Bengaluru (INDIA). E-mail: frjoseph@christuniversity.in

A path decomposition of a graph G is a collection F of its edge disjoint paths whose union is the given graph. The pendant number of the graph G is defined as the least number of end vertices of paths involved in the path decomposition of G. In this chapter, we discuss the pendant number of the Cartesian product as well as the direct product ...

Get Recent Advancements in Graph Theory now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.

Start your free trial