4 papers
Independence Polynomials of 2-step Nilpotent Lie Algebras
Marco Aldi, Thor Gabrielsen, Daniele Grandini +2
Motivated by the Dani-Mainkar construction, we extend the notion of independence polynomial of graphs to arbitrary 2-step nilpotent Lie algebras. After establishing efficiently com…
The -Total Bondage Number of a Graph
Jean-Pierre Appel, Gabby Fischberg, Kyle Kelley +2
Let be a connected, finite undirected graph. A set is said to be a total dominating set of if every vertex in is adjacent to some vertex in . T…
An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs
Marco Aldi, Thor Gabrielsen, Daniele Grandini +2
We introduce a lower bound for the independence number of an arbitrary -uniform hypergraph that only depends on the number of vertices and number of edges of the hypergraph.
Properties of Sub-Add Move Graphs
Patrick Cesarz, Eugene Fiorini, Charles Gong +3
We introduce the notion of a move graph, that is, a directed graph whose vertex set is a -module , and whose arc set is uniquely determined by the action…