Characterizing when powers of a caterpillar are divisor graphs.

MaRDI QIDQ4982888zbMATH OpenFDO

Authors Eman A. AbuHijleh, O. A. AbuGhneim, H. Al-Ezeh

Publication date 13 April 2015

zbMATH Keywords

caterpillardivisor graphpower of a graph

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Graph theory (05C99)

Recommendations

• Divisor orientations of powers of paths and powers of cycles.
• scientific article; zbMATH DE number 6007752
• Spanning caterpllars with bounded diameter
• scientific article; zbMATH DE number 5180853
• Note on factorization of complete graphs into caterpillars with small diameters

Cited in

(3)

• Characterizing which powers of hypercubes and folded hypercubes are divisor graphs
• Divisor orientations of powers of paths and powers of cycles.
• scientific article; zbMATH DE number 6007752 (Why is no real title available?)

This page was built for publication: Characterizing when powers of a caterpillar are divisor graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4982888)