Your selections:
Enumerations of vertex orders of almost Moore digraphs with selfrepeats
- Baskoro, Edy, Cholily, Yus Mochamad, Miller, Mirka
Graphs of order two less than the Moore bound
- Miller, Mirka, Simanjuntak, Rinovia
HSAGA and its application for the construction of near-Moore digraphs
- Tang, Jianmin, Miller, Mirka, Lin, Yuqing
On consecutive edge magic total labeling of graphs
- Sugeng, Kiki Ariyanti, Miller, Mirka
On the connectivity of (k, g)-cages of even girth
- Lin, Yuqing, Balbuena, Camino, Marcote, Xavier, Miller, Mirka
A lower bound on the order of regular graphs with given girth pair
- Balbuena, Camino, Jiang, T., Lin, Yuqing, Marcote, Xavier, Miller, Mirka
- Nguyen, Minh Hoang, Miller, Mirka, Gimbert, Joan
All (k;g)-cages are edge-superconnected
- Lin, Yuqing, Miller, Mirka, Balbuena, Camino, Marcote, Xavier
Characterization of eccentric digraphs
- Gimbert, Joan, Lopez, Nacho, Miller, Mirka, Ryan, Joe
- Balbuena, Camino, Barker, Ewan, Lin, Yuqing, Miller, Mirka, Sugeng, Kiki Ariyanti
On the degrees of a strongly vertex-magic graph
- Balbuena, Camino, Barker, Ewan, Das, K. C., Lin, Yuqing, Miller, Mirka, Ryan, Joe, Slamin,, Sugeng, Kiki Ariyanti, Tkac, M.
Two new families of large compound graphs
- Marti, J. Gomez, Miller, Mirka
All (k;g)-cages are k-edge-connected
- Lin, Yuqing, Miller, Mirka, Rodger, Chris
Complete characterization of almost moore digraphs of degree three
- Baskoro, Edy, Miller, Mirka, Siran, Jozef, Sutton, Martin
Are you sure you would like to clear your session, including search history and login status?