143
Views
12
CrossRef citations to date
0
Altmetric
Original Articles

Path-connectivity of lexicographic product graphs

Pages 27-39 | Received 02 Jul 2014, Accepted 31 Oct 2014, Published online: 13 Dec 2014

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (1)

Yaping Mao, Fengnan Yanling, Zhao Wang & Chengfu Ye. (2016) Rainbow vertex-connection and graph products. International Journal of Computer Mathematics 93:7, pages 1078-1092.
Read now

Articles from other publishers (11)

Qihui Jin, Shasha Li & Mengmeng Xie. (2023) 3-path-connectivity of Cayley graphs generated by transposition trees. Discrete Applied Mathematics 339, pages 292-299.
Crossref
Wen-Han Zhu, Rong-Xia Hao, Yan-Quan Feng & Jaeun Lee. (2023) Path connectivity of line graphs and total graphs of complete bipartite graphs. Applied Mathematics and Computation 457, pages 128182.
Crossref
Wen-Han Zhu, Rong-Xia Hao, Yan-Quan Feng & Jaeun Lee. (2023) The 3-path-connectivity of the -ary -cube . Applied Mathematics and Computation 436, pages 127499.
Crossref
Wen-Han Zhu, Rong-Xia Hao & Lin Li. (2022) The 3-path-connectivity of the hypercubes. Discrete Applied Mathematics 322, pages 203-209.
Crossref
Pi Wang, Shasha Li & Xiaoxue Gao. (2022) k-Path-Connectivity of Completely Balanced Tripartite Graphs. Axioms 11:6, pages 270.
Crossref
Nan Jia, Yaping Mao, Zhao Wang & Eddie Cheng. (2021) Linear k-arboricity of Caylay Graphs on Abelian Groups with Given Degree. Mathematics in Computer Science 15:4, pages 743-755.
Crossref
Tianlong Ma, Jinling Wang, Mingzu Zhang & Xiaodong Liang. (2020) Path 3-(edge-)connectivity of lexicographic product graphs. Discrete Applied Mathematics 282, pages 152-161.
Crossref
YINGYING ZHANG & XIAOYU ZHU. (2019) Proper Vertex Connection and Graph Operations. Journal of Interconnection Networks 19:02, pages 1950001.
Crossref
Yaping Mao, Fengnan Yanling, Zhao Wang & Chengfu Ye. (2017) Proper Connection Number of Graph Products. Bulletin of the Malaysian Mathematical Sciences Society 41:4, pages 2041-2051.
Crossref
Yaping Mao. (2017) Constructing edge-disjoint Steiner paths in lexicographic product networks. Applied Mathematics and Computation 308, pages 1-10.
Crossref
YAPING MAO, ZHIWEI GUO, NAN JIA & HE LI. (2017) Linear k -Arboricity in Product Networks . Journal of Interconnection Networks 16:03n04, pages 1650008.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.