On the profile of the corona of two graphs

DOI10.1016/j.ipl.2003.12.004zbMath1183.68431OpenAlexW2135598208MaRDI QIDQ1029099

Yung-Ling Lai, Gerard Jennhwa Chang

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.12.004

zbMATH Keywords

profilecoronacycleinterval graphcomplete graphcaterpillarnumbering

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Coloring, location and domination of corona graphs ⋮ The profile of the Cartesian product of graphs ⋮ On the controllability of Corona product network ⋮ r-Dynamic coloring of the corona product of graphs

Cites Work

• Algorithms for the reduction of matrix bandwidth and profile
• On graphs having domination number half their order
• Profile minimization problem for matrices and graphs
• Exact profile values of some graph compositions
• Profile minimization on triangulated triangles
• Graph Searching and Interval Completion
• On interval graphs and matrice profiles
• Domination-balanced graphs
• The bandwidth problem for graphs and matrices—a survey
• Algorithms for reducing the bandwidth and profile of a sparse matrix
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• The Profile Minimization Problem in Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the profile of the corona of two graphs