检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Li-Ping Wang Daqing Wan Weiqiong Wang Haiyan Zhou
机构地区:[1]State Key Laboratory of Information Security,Institute of Information Engineering,CAS,China [2]School of Cyber Security,University of Chinese Academy of Sciences,China [3]Department of Mathematics,University of California,Irvine,CA,USA [4]School of Science,Chan’an University,Xi'an,China [5]School of Mathematics,Nanjing Normal University,Nanjing,China
出 处:《Communications in Mathematical Research》2022年第2期319-332,共14页数学研究通讯(英文版)
基 金:The work of L.-P.Wang was supported in part by the National Natural Science Foundation of China(Grant No.61872355);National Key Research and Development Program of China(Grant No.2018YFA0704703).
摘 要:We introduce a new infinite class of bipartite graphs, called jumped Wenger graphs, which has a similar structure with Wenger graphs. We give a tight upper bound of the diameter for these graphs and the exact diameter for some special graphs. We also determine the girth of the jumped Wenger graphs.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.91