activity
19972020
most citedA new method for enumerating independent sets of a fixed size in general graphs

3 citations · 8 across the 8 of their papers we have counts for

collaborators

8 papers

math.RA2020

Biordered Sets of Regular Rings

James Alexander, E. Krishnan

The set of idempotents of a regular semigroup is given an abstract characterization as a regular biordered set in [2], and in [4] it is shown how a biordered set can be associated…

math.MG2019★ 1 cited

The -property of a simple arc

J. Ralph Alexander, John E. Wetzel, Wacharin Wichiramala

In 2006 P. Coulton and Y. Movshovich established an unfamilar but note-worthy general property of simple, polygonal, open arcs in the plane. We give a new and quite different proof…

math.RA2016★ 3 cited

Non-noetherian groups and primitivity of their group algebras

James Alexander, Tsunekazu Nishinaka

We prove that the group algebra of a group over a field is primitive, provided that has a free subgroup with the same cardinality as , and that satisfies th…

math.CO2015★ 1 cited

Designs from Paley graphs and Peisert graphs

James Alexander

Fix positive integers and so that is prime, , and (mod ). Fix a graph as follows: If is odd or (mod ), let be th…

math.CO2014

A graph theoretic encoding of Lucas sequences

James Alexander, Paul Hearding

Some well-known results of Prodinger and Tichy are that the number of independent sets in the -vertex path graph is , and that the number of independent sets in the …

math.CO2013★ 3 cited

A new method for enumerating independent sets of a fixed size in general graphs

James Alexander, Tim Mink

We develop a new method for enumerating independent sets of a fixed size in general graphs, and we use this method to show that a conjecture of Engbers and Galvin holds for all but…