$n$-Array Jacobson graphs
چکیده(به انگلیسی؛ چکیدهی فارسی در دسترس نیست)
We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.
نویسندگان و وابستگی سازمانی
- H. Ghayour — erdowsi University of Mashhad, International Campus, Mashhad, Iran.
- A. Erfanian — Department of Pure Mathematics, Ferdowsi University of Mashhad, Mashhad, Iran.
- A. Azimi — Department of Mathematics, University of Neyshabur, P. O. Box 91136-899, Neyshabur, Iran.
- M. Farrokhi D. G. — Department of Pure Mathematics, Ferdowsi University of Mashhad, Mashhad, Iran.