The tripartite separability of density matrices of graphs.
Wang, Zhen, Wang, Zhixi (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Wang, Zhen, Wang, Zhixi (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Xu, Xiaodong, Luo, Haipeng, Shao, Zehui (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chao, Chong-Yun (2001)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Le Anh Vinh (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Allen, Peter (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dobrynin, V., Pliskin, M., Prosolupov, E. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cariolaro, David, Cariolaro, Gianfranco (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hajiabolhassan, Hossein, Taherkhani, Ali (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jaroslav Ivančo, Tatiana Polláková (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we establish some conditions for graphs with a saturated vertex to be supermagic. Inter alia we show that complete multipartite graphs K1,n,n and K1,2,...,2 are supermagic.
Lowell W. Beineke, Gary Chartrand (1968)
Compositio Mathematica
Similarity:
Fischer, Eldar (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Girse, Robert D. (1986)
International Journal of Mathematics and Mathematical Sciences
Similarity: