Congestion-sum problem of Petersen graphs into complete binary trees

MaRDI QIDQ6566241zbMATH OpenFDO

Authors Paul Manuel, Indra Rajasingh, Bharati Rajan, Jasintha Quadras

Publication date 3 July 2024

Published in Journal of Combinatorics, Information \& System Sciences (Search for Journal in Brave)

zbMATH Keywords

congestioncongestion-sumembeddinglabelingtree

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Congestion-sum problem of Petersen graphs into complete binary trees

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