Your selections:
Graphs of order two less than the Moore bound
- Miller, Mirka, Simanjuntak, Rinovia
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.
Characterization of eccentric digraphs
- Gimbert, Joan, Lopez, Nacho, Miller, Mirka, Ryan, Joe
On irregular total labellings
- Baca, Martin, Jendrol, Stanislav, Miller, Mirka, Ryan, Joe
Enumerations of vertex orders of almost Moore digraphs with selfrepeats
- Baskoro, Edy, Cholily, Yus Mochamad, Miller, Mirka
On 2-walks in chordal planar graphs
Moore bound for mixed networks
- Nguyen, Minh Hoang, Miller, Mirka
Structural properties of graphs of diameter 2 with maximal repeats
- Nguyen, Minh Hoang, Miller, Mirka
- Balbuena, Camino, Barker, Ewan, Lin, Yuqing, Miller, Mirka, Sugeng, Kiki Ariyanti
Improved lower bound for the vertex connectivity of (delta;g)-cages
- Lin, Yuqing, Miller, Mirka, Balbuena, Camino
- Nguyen, Minh Hoang, Miller, Mirka, Gimbert, Joan
Cayley graphs as classifiers for data mining : The influence of asymmetries
- Kelarev, Andrei, Ryan, Joe, Yearwood, John
A sum labelling for the generalised friendship graph
- Fernau, Henning, Ryan, Joe, Sugeng, Kiki Ariyanti
On the connectivity of (k, g)-cages of even girth
- Lin, Yuqing, Balbuena, Camino, Marcote, Xavier, Miller, Mirka
- Baca, Martin, Lin, Yuqing, Miller, Mirka, Youssef, Maged
Are you sure you would like to clear your session, including search history and login status?