8 citations
- Shenzhen Institutes of Advanced TechnologyCN2 papers
- University of JohannesburgZA2 papers
- Emory UniversityUS1 paper
- Houston Fertility InstituteUS1 paper
- Keene State CollegeUS1 paper
- North Carolina State UniversityUS1 paper
- Open University of IsraelIL1 paper
- OpticaUS1 paper
- Oranim Academic College of EducationIL1 paper
- Rice UniversityUS1 paper
- Schlumberger (United States)US1 paper
- Spring Branch Medical CenterUS1 paper
5 papers · 1 filter
N-ary groups of panmagic permutations from the Post coset theorem
Sergiy Koshkin, Jaeho Lee
Panmagic permutations are permutations whose matrices are panmagic squares, better known as solutions to the modular n-queens problem, configurations of n non-attacking queens on a…
Panmagic permutations and N-ary groups
Sergiy Koshkin, Jaeho Lee
Panmagic permutations are permutations whose matrices are panmagic squares. Positions of 1-s in the latter describe maximal configurations of non-attacking queens on a toroidal che…
Conjecture of TxGraffiti: Independence, domination, and matchings
Yair Caro, Randy Davila, Michael Henning +1
TxGraffiti is an automated conjecturing program that produces graph theoretic conjectures in the form of conjectured inequalities. This program written and maintained by the second…
Extremal -forcing sets in oriented graphs
Yair Caro, Randy Davila, Ryan Pepper
This article studies the \emph{-forcing number} for oriented graphs, generalizing both the \emph{zero forcing number} for directed graphs and the -forcing number for simple g…
Degree Sequence Index Strategy
Yair Caro, Ryan Pepper
We introduce a procedure, called the Degree Sequence Index Strategy (DSI), by which to bound graph invariants by certain indices in the ordered degree sequence. As an illustration…