A study on the pendant number of graph products

DOI10.2478/ausi-2019-0002zbMath1430.05102OpenAlexW2969933934WikidataQ127345435 ScholiaQ127345435MaRDI QIDQ2283724

Charles Dominic, Jomon K. Sebastian Kottarathil, Joseph Varghese Kureethara, Sudev Naduvath

Publication date: 13 January 2020

Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/ausi-2019-0002

zbMATH Keywords

path decompositiongraph operationspendant number

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

A study on the pendant number of graph products

Cites Work

• Unnamed Item
• Some graphs determined by their spectra
• Topological integer additive set-sequential graphs
• On the sum of all distances in composite graphs
• A study on the pendant number of graph products

This page was built for publication: A study on the pendant number of graph products