4 citations · 5 across the 3 of their papers we have counts for
12 papers
Total domination number of middle graphs
Farshad Kazemnejad, Behnaz Pahlavsay, Elisa Palezzato +1
A total dominating set of a graph G with no isolated vertices is a subset S of the vertex set such that every vertex of G is adjacent to a vertex in S. The total domination number…
Total dominator coloring number of middle graphs
Farshad Kazemnejad, Behnaz Pahlavsay, Elisa Palezzato +1
A total dominator coloring of a graph G is a proper coloring of G in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic n…
Domination number of middle graphs
Farshad Kazemnejad, Behnaz Pahlavsay, Elisa Palezzato +1
In this paper, we study the domination number of middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph. We also compute the domination nu…
-Lefschetz properties, sectional matrices and hyperplane arrangements
Elisa Palezzato, Michele Torielli
In this article, we study the -Lefschetz properties for non-Artinian algebras, proving that several known results in the Artinian case can be generalized in this setting. Moreov…
Domination for latin square graphs
Behnaz Pahlavsay, Elisa Palezzato, Michele Torielli
In combinatorics, a latin square is a matrix filled with n different symbols, each occurring exactly once in each row and exactly once in each column. Associated to eac…
Lefschetz Properties and Hyperplane Arrangements
Elisa Palezzato, Michele Torielli
In this article, we study the weak and strong Lefschetz properties, and the related notion of almost revlex ideal, in the non-Artinian case, proving that several results known in t…