Showing math.COShow all
4 papers · 1 filter
math.CO2024
Proof of Lovász conjecture for odd order
Misa Nakanishi
Lovász conjectured that every connected vertex-transitive graph contains a hamilton path in 1970. First we reveal the structure of connected vertex-transitive graphs with an odd nu…
math.CO2018
Efficient domination in regular graphs
Misa Nakanishi
In this paper, we study efficient domination in regular graphs.
math.CO2017
Domination structure for number three
Misa Nakanishi
From a research of several recent papers, in the first part, we are concerned with domination number in cubic graphs and give a sufficient condition of Reed's conjecture. In the se…
math.CO2017
Transposition diameter on circular binary strings
Misa Nakanishi
On the string of finite length, a (genomic) transposition is defined as the operation of exchanging two consecutive substrings. The minimum number of transpositions needed to trans…