Your selections:
Knowledge based regulation of statistical databases
- Mishra, Vivek, Stranieri, Andrew, Miller, Mirka, Ryan, Joe
Managing privacy, trust, security, and context relationships using weighted graph representations
- Skinner, Geoff, Miller, Mirka
- Fiol, M. A., Gimbert, Joan, Miller, Mirka
New largest graphs of diameter 6. (Extended Abstract)
- Pineda-Villavicencio, Guillermo, Gomez, Jose, Miller, Mirka, Pérez-Rosés, Hebert
On graphs of maximum size with given girth and order
- Miller, Mirka, Lin, Yuqing, Brankovic, Ljiljana, Tang, Jianmin
- Miller, Mirka, Koh, K. M., Smyth, W. F., Wang, Yan
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.
Structure of repeat cycles in almost Moore digraphs with selfrepeats and diameter 3
- Miller, Mirka, Baskoro, Edy, Cholily, Yus Mochamad
Sum graph based access structure in a secret sharing scheme
- Miller, Mirka, Slamet, Surjadi, Sugeng, Kiki Ariyanti
Super edge-antimagic total labeling
- Sugeng, Kiki Ariyanti, Miller, Mirka, Baca, Martin
Super edge-antimagicness for a class of disconnected graphs
- Dafik, Miller, Mirka, Ryan, Joe, Baca, Martin
Super edge-magic total labeling of spiked fans, hyper x-trees, dew drops and prisms
- Miller, Mirka, Rajasingh, Indra, Rajan, Bharati, Manuel, Paul
Survey of edge antimagic labelings of graphs
- Miller, Mirka, Baca, Martin, Baskoro, Edy, Ryan, Joe, Simanjuntak, Rinovia, Sugeng, Kiki Ariyanti
Two new families of large compound graphs
- Marti, J. Gomez, Miller, Mirka
Vertex-magic total labeling of generalized Petersen graphs and convex polytopes
- Miller, Mirka, Baca, Martin, MacDougall, James
A lower bound on the order of regular graphs with given girth pair
- Balbuena, Camino, Jiang, T., Lin, Yuqing, Marcote, Xavier, Miller, Mirka
An open problem : (4; g)-cages with odd g <= 5 are tightly connected
- Tang, Jianmin, Balbuena, Camino, Lin, Yuqing, Miller, Mirka
- Baca, Martin, Lin, Yuqing, Miller, Mirka
Diameter-sufficient conditions for a graph to be super-restricted connected
- Balbuena, Camino, Lin, Yuqing, 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?