Abstract
Let and be two graphs. The Kronecker product has vertex set and the edge set In this paper we show that if is a complete multipartite graph, where the parameters satisfying certain conditions and is a path of length n−1, then is not super i-connected, where and . Also we show that is not super connected, where is a cycle of length n and .
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computer Mathematics: Computer Systems Theory
Paper Title
Journal
Date
