13 citations · 33 across the 22 of their papers we have counts for
17 papers · 1 filter
Inductive approach to chromatic and characteristic polynomials
Madison Cox, Michele Torielli
In this article we describe a new inductive approach to compute the chromatic polynomial of simple graphs and the characteristic polynomial of central hyperplane arrangements.
Enumerative combinatorics package for CoCoA
Akin Scott, Michele Torielli
We introduce the package combinatorics for the software CoCoA. This package provides a data structure and the necessary methods for computing several known enumerative combinatoria…
Freeness of hyperplane arrangements associated with gain graphs
Daisuke Suyama, Michele Torielli, Shuhei Tsujie
Athanasiadis studied arrangements obtained by adding shifted hyperplanes to the braid arrangement. Similarly, Bailey studied arrangements obtained by adding tilted hyperplanes to t…
Total outer-connected domination number of middle graphs
Farshad Kazemnejad, Behnaz Pahlavsay, Elisa Palezzato +1
In this paper, we study the total outer-connected domination number of the middle graph of a simple graph and we obtain tight bounds for this number in terms of the order of the mi…
Connected and outer-connected domination number of middle graphs
Farshad Kazemnejad, Behnaz Pahlavsay, Elisa Palezzato +1
In this paper, we study the notions of connected domination number and of outer-connected domination number for middle graphs. Indeed, we obtain tight bounds for this number in ter…
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…