From the 1 of 6 linked papers with an AI index.
6 papers
Is the Aharonov-Casher phase geometrical or dynamical?
Igor Kuzmenko, Y. B. Band, Yshai Avishai
We consider two two-dimensional (2D) electronic systems in the presence of a perpendicular homogeneous electric field that generates a Rashba spin-orbit interaction (RSOI): a syste…
Proximity Measures for Classes of Phylogenetic Networks
Leo van Iersel, Mark Jones, Esther Julien +2
The paper defines and analyzes proximity measures that quantify how many graph modifications are needed to convert a phylogenetic network into a member of specific network classes…
List -coloring -free graphs of diameter- in polynomial-time
Yukihiro Murakami
We show that list -coloring a~-free graph of diameter- can be done in polynomial-time. Our algorithm is based on a structural characterization showing that many such gra…
Burning Graph Powers and Branching Trees
Jesper Jansson, Shashanka Kulamarva, Yukihiro Murakami +1
Graph burning is a discrete-time process that models the spread of social contagion. Initially, all vertices are unburned. In each round, one unburned vertex is selected and burned…
Note on the Maximum Number of Trees Displayed by a Tree-Child Network
Yukihiro Murakami, Charles Semple
In this note, we show that, for all , the number of distinct rooted binary phylogenetic -trees displayed by a binary tree-child network on with lea…
Metrics for classes of semi-binary phylogenetic networks using -representations
Christopher Reichling, Leo van Iersel, Yukihiro Murakami
Phylogenetic networks are useful in representing the evolutionary history of taxa. In certain scenarios, one requires a way to compare different networks. In practice, this can be…