Decycling numbers of strong product graphs involving paths, circuits, stars or complete graphs

zbMATH Open1339.05336MaRDI QIDQ2815862FDOQ2815862

Authors: Jinshan Xie, X. Chen, Yongxuan Lai 

Publication date: 30 June 2016

Published in: International Journal of Applied Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL: http://www.ceser.in/ceserp/index.php/ijamas/article/view/3332

Recommendations

• Decycling number of the box-cross product of two paths
• Decycling Cartesian Products of Two Cycles
• The decycling number of \(P_m\square P^\ast_n\)
• Decycling powers of paths and of cycles
• Decycling sets in certain Cartesian product graphs with one factor complete

zbMATH Keywords

circuitstrong productcomplete graphpathstardecycling number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Applications of graph theory to circuits and networks (94C15)

Cited In (1)

• Decycling number of the box-cross product of two paths

This page was built for publication: Decycling numbers of strong product graphs involving paths, circuits, stars or complete graphs

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