Open Locating-Dominating Sets in Circulant Graphs
Givens, Robin M., Yu, Gexin, Kincaid, Rex K.
Published in Discussiones Mathematicae. Graph Theory (01.02.2022)
Published in Discussiones Mathematicae. Graph Theory (01.02.2022)
Get full text
Journal Article
Channel-Hopping-Based Communication Rendezvous in Cognitive Radio Networks
Zhang, Yifan, Yu, Gexin, Li, Qun, Wang, Haodong, Zhu, Xiaojun, Wang, Baosheng
Published in IEEE/ACM transactions on networking (01.06.2014)
Published in IEEE/ACM transactions on networking (01.06.2014)
Get full text
Journal Article
ETCH: Efficient Channel Hopping for communication rendezvous in dynamic spectrum access networks
Yifan Zhang, Qun Li, Gexin Yu, Baosheng Wang
Published in 2011 Proceedings IEEE INFOCOM (01.04.2011)
Published in 2011 Proceedings IEEE INFOCOM (01.04.2011)
Get full text
Conference Proceeding
Hamiltonian connectedness in 3-connected line graphs
Lai, Hong-Jian, Shao, Yehong, Yu, Gexin, Zhan, Mingquan
Published in Discrete Applied Mathematics (06.03.2009)
Published in Discrete Applied Mathematics (06.03.2009)
Get full text
Journal Article
On Minimum Degree Implying That a Graph is H‐Linked
Gould, Ronald J., Kostochka, Alexandr, Yu, Gexin
Published in SIAM journal on discrete mathematics (01.01.2006)
Published in SIAM journal on discrete mathematics (01.01.2006)
Get full text
Journal Article