مرور Volume 7, Issue 3 بر اساس عنوان

در حال نمایش موارد 1 - 5 از 5

  • The annihilator graph of a 0-distributive lattice 

    Bagheri, Saeid؛ Koohi Kerahroodi, Mahtab (University of Isfahan, 2018-09-01)
    ‎‎In this article‎, ‎for a lattice $mathcal L$‎, ‎we define and investigate‎ ‎the annihilator graph $mathfrak {ag} (mathcal L)$ of $mathcal L$ which contains the zero-divisor graph of $mathcal L$ as a subgraph‎. ‎Also‎, ...

  • Iota energy of weighted digraphs 

    Hafeez, Sumaira؛ Khan, Mehtab (University of Isfahan, 2018-09-01)
    The eigenvalues of a digraph are the eigenvalues of its adjacency matrix. The iota energy of a digraph is recently defined as the sum of absolute values of imaginary part of its eigenvalues. In this paper, we extend the ...

  • $mathcal{B}$-Partitions, determinant and permanent of graphs 

    Singh, Ranveer؛ Bapat, Ravindra (University of Isfahan, 2018-09-01)
    Let $G$ be a graph (directed or undirected) having $k$ number of blocks $B_1, B_2,hdots,B_k$. A $mathcal{B}$-partition of $G$ is a partition consists of $k$ vertex-disjoint subgraph $(hat{B_1},hat{B_1},hdots,hat{B_k})$ ...

  • A spectral excess theorem for digraphs with normal Laplacian matrices 

    Shafiei, Fateme (University of Isfahan, 2018-09-01)
    The spectral excess theorem‎, ‎due to Fiol and Garriga in 1997‎, ‎is an important result‎, ‎because it gives a good characterization‎ ‎of distance-regularity in graphs‎. ‎Up to now‎, ‎some authors have given some variations ...

  • Sufficient conditions for triangle-free graphs to be super-$λ'$ 

    Cheng, Huiwen؛ Li, Yan-Jing (University of Isfahan, 2018-09-01)
    An edge-cut $F$ of a connected graph $G$ is called a‎ ‎restricted edge-cut if $G-F$ contains no isolated vertices‎. ‎The minimum cardinality of all restricted edge-cuts‎ ‎is called the restricted edge-connec ...