The distinguishing number of Kronecker product of two graphs
From MaRDI portal
Publication:1683578
DOI10.1007/978-3-319-64419-6_44zbMath1496.05155arXiv1610.07200OpenAlexW2745708263MaRDI QIDQ1683578
Samaneh Soltani, Saeid Alikhani
Publication date: 1 December 2017
Full work available at URL: https://arxiv.org/abs/1610.07200
Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
This page was built for publication: The distinguishing number of Kronecker product of two graphs