Article

$n$-Array Jacobson graphs

$n$-Array Jacobson graphs

Download full textFree with an account; signing up with Google takes seconds

Abstract

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.

Authors and affiliations
  1. H. Ghayour — erdowsi University of Mashhad, International Campus, Mashhad, Iran.
  2. A. Erfanian — Department of Pure Mathematics, Ferdowsi University of Mashhad, Mashhad, Iran.
  3. A. Azimi — Department of Mathematics, University of Neyshabur, P. O. Box 91136-899, Neyshabur, Iran.
  4. M. Farrokhi D. G. — Department of Pure Mathematics, Ferdowsi University of Mashhad, Mashhad, Iran.

Similar items

  • Covering Arrays on Graphs: Qualitative Independence Graphs and Extremal Set Partition Theory

    Scholarly record2005Karen Meagher

    There has been a good deal of research on covering arrays over the last 20 years. Most of this work has focused on constructions, applications and generalizations of covering arrays. The main focus of this thesis is a generalization of covering arrays, covering arrays on graphs.

  • Indeterminate strings, prefix arrays & undirected graphs

    Scholarly record2015Theor. Comput. Sci.Manolis Christodoulakis, P. J. Ryan, William F. Smyth, Shu Wang

    An integer array y = y[1..n] is said to be feasible if and only if y[1] = n and, for every i ∈ 2..n, i ≤ i+y[i] ≤ n+1. A string is said to be indeterminate if and only if at least one of its elements is a subset of cardinality greater than one of a given alphabet Σ; otherwise it

  • Mixed Covering Arrays on Graphs

    Scholarly record2006L Moura

    We give upper and lower bounds on the size of mixed covering arrays on graphs based on graph homomorphisms. We provide constructions for covering arrays on graphs based on basic graph operations. In particular, we construct optimal mixed covering arrays on trees, cycles and bipar

  • Classification of rings with toroidal Jacobson graph

    Open-access article2016Czechoslovak Mathematical JournalKrishnanSelvakumar, ManoharanSubajini

    Let R be a commutative ring with nonzero identity and J(R) the Jacobson radical of R. The Jacobson graph of R, denoted by J R , is defined as the graph with vertex set R J(R) such that two distinct vertices x and y are adjacent if and only if 1 − xy is not a unit of R. The genus

  • Jacobson graph over Z n

    Open-access article2021Journal of Physics: Conference SeriesMochammad ZulfikarAditya, Intan MuchtadiAlamsyah

    Abstract Let n ≥ 2. A Jacobson graph over ℤ n is a graph with vertex set all elements in ℤ n except elements in its Jacobson radical, and x and y are adjacent if and only if 1 − xy is not relative prime to n. In this paper, we give a characterization of Jacobson graph over ℤ n as

  • The matrix Jacobson graph of fields

    Open-access article2020Journal of Physics: Conference SeriesSHumaira, PAstuti, IMuchtadi-Alamsyah, AErfanian

    Abstract The notion of Jacobson graph and n-array Jacobson graph of a commutative ring were introduced in 2012 and 2018, respectively, by Azimi et al and Ghayour et al. In this article we generalize them to matrix Jacobson graph. Let R be a commutative ring. The matrix Jacobson g