首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Convex Sets in Lexicographic Products of Graphs
Authors:Bijo S Anand  Manoj Changat  Sandi Klav?ar  Iztok Peterin
Institution:1. Department of Futures Studies, University of Kerala, Trivandrum, 695034, India
2. Faculty of Mathematics and Physics, University of Ljubljana, Ljubljana, Slovenia
3. Faculty of Natural Sciences and Mathematics, University of Maribor, Maribor, Slovenia
4. Institute of Mathematics and Physics, FEECS, University of Maribor, Maribor, Slovenia
Abstract:Geodesic convex sets, Steiner convex sets, and J-convex (alias induced path convex) sets of lexicographic products of graphs are characterized. The geodesic case in particular rectifies Theorem 3.1 in Canoy and Garces (Graphs Combin 18(4):787–793, 2002).
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号