学术研究

学术交流信息

当前位置: 首页 > 学术研究 > 学术交流信息 > 正文
【天元前沿论坛】图论, 人工智能与复杂网络国际研讨会
日期:2018-07-22 点击:

项目编号:天元前沿论坛QY201808

会议时间:2018年7月27日-31日

会议地点:青海师范大学

日程安排:


Saturday, July 28, 8:30 AM – 12:15 PM   Room:   107,Tianjiabing Building  

(2018年7月28日上午大会报告: 城西校区田家炳1楼学术报告厅)

Chair:Haixing   Zhao

08:30-08:45

Opening Remarks (开幕致辞)

President of Qinghai University (校领导)

08:45-9:00:Group Photo (全体合影)

Chair:Xuelaing   Li

9:00-9:30

Hajo Broersma

University of Twente

The power of closure operations

9:30-10:00

Akira Saito

Nihon University

Hamiltonian bipartite graphs in dense graphs

10:00-10:30

Bing Wei

University of   Mississippi

Independent bondage number of a graph

Chair:Shenggui Zhang  

10:45-11:15

Ingo Schiermeyer

Freiberg University of Mining and Technology

Gallai Ramsey number for K_4 and K_5

11:15-11:45

Zi-Xia Song

University of Central Florida


Multicolor Gallai-Ramsey numbers of cycles  

11:45-12:15

Colton Magnant Georgia Southern   University

Gallai-Ramsey numbers - General

bounds and sharp cases

Saturday, July 28, 14:30 PM – 17:45 PM  Session#1 in Room:107, Tianjiabing Building

2018年7月28日下午分组1:城西校区田家炳1楼学术报告厅

Chair:Ligong Wang  

14:30-15:00

Changjiang Bu

Harbin Engineering University

哈尔滨工程大学

Laplacian tensor and connectivity of uniform hypergraphs

15:00-15:30

Jianbin Zhang

South China Normal   University

华南师范大学

The spectral radius of connected k-

uniform hypergraphs

15:30-16:00

Fengwei Li

Shaoxing University

绍兴文理学院

Spectral properties of inverse sum Indeg index

Chair:Deqin Chen

16:15-16:45

Ligong Wang

Northwest Polytechnical Uniwersity

西北工业大学

Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree

16:45-17:15

Jianfeng Wang

Shandong University of   Technology

山东理工大学

A note on the connected graphs with distinct   eigenvalues

17:15-17:45

Lizhu Sun

Harbin Engineering University

哈尔滨工程大学

Bounds for the spectral radii of hypergraphs via   tensors

Saturday, July 28, 14:30 PM – 17:45 PM  Session#2     in Room: 204,  Tianjiabing Building

2018年7月28日下午:分组学术活动(分组2:城西校区田家炳楼2楼会议室)

Chair:Zemin Jin

14:30-15:00

Liming Xiong

Beijing Institute of Technology

北京理工大学

Forbidden subgraphs and factors in graphs

15:00-15:30

Zongtian Wei

Xi'an University of Architecture

and Technology

西安建筑科技大学

Some open problems about neighbor scattering number of   graphs

15:30-16:00

Zanbo Zhang

Guangdong Industry Technical College

广东轻工职业技术学院

Cycles of many lengths in bipartite tournaments and   auxiliary graphs

Chair:Hong Bian

16:15-16:45

Guangfu Wang

East China Jiaotong

University

华东交通大学

L-embeddability of   generic quadrilateral Möbius maps

16:45-17:15

Jun Yue

Shandong Normal University

山东师范大学

On the double Roman domination of graphs

17:15-17:45

Ran Gu

Hohai University

河海大学

Path connectivity of random graphs

Saturday, July 28, 14:30 PM – 17:45 PM  Session#3 in Room: 304, Tianjiabing Building

2018年7月28日下午:分组学术活动(分组3:城西校区田家炳楼3楼会议室)

Chair:Genjiu Xu

14:30-15:00

Hao Sun

Northwestern Polytechnical University

西北工业大学

Associated games to optimize the core of a TU game

15:00-15:30

Ruihu Li

Air force Engineering   University

空军工程大学

纠错码的几个问题

15:30-16:00

Zhihui Li

Shaanxi Normal University

陕西师范大学

The optimal information rate for graph access   structures of nine participants

Chair:Zhihui Li

16:15-16:45

Xiangjuan Yao

China University of Mining and Technology

中国矿业大学

Genetic algorithm and its application in softwaretesting

16:45-17:15

Wenli Zhou

Huawei Company

华为公司

Graph computing and its application in industry

17:15-17:45

Shuming Zhou

Fujiang Normal University

福建师范大学

Reliability assessment on multiprocessor system based on (n,k)-star networks

Saturday, July   28, 14:30 PM – 17:45 PM  Session#4   in Room: 703,   Science Building

2018年7月28日下午:分组学术活动(分组4:城西校区科技楼7楼报告厅)

Chair:Baoyindureng Wu

14:30-15:00

Wenxue Du

Anhui University

安徽大学

On a measure of graphs

15:00-15:30

Yuefang Sun

Shaoxing University

绍兴文理学院

Strong subgraph k-connectivity

15:30-16:00

Hengzhe Li

Henan Normal University

河南师范大学

Steiner tree packing number and tree connectivity

Chair:Zongqian Wei

16:15-16:45

He Chen

Southeast University

东南大学

Coupon coloring of cographs

16:45-17:15

Yan Zhao

Taizhou University

泰州学院

The k(-vertex)-rainbow index of a connected graph

17:15-17:45

Zhong Huang

Nankai University

南开大学

On the conflict-free connection number of graphs

Sunday, July   29, 8:30 AM – 12:15 PM     Room: 107,Tianjiabing Building  

2018年7月29日上午:大会报告(城西校区田家炳1楼学术报告厅)

Chair:Liming Xiong

8:30-9:00

Xingxing Yu

Georgia Institute of Technology

佐治亚理工学院

Problems related to the Four Color Theorem

9:00-9:30

Hongjian Lai

West Virginia   University

西弗吉尼亚大学

图的群连通和模定向问题的一些进展

9:30-10:00

Kenta Ozeki  

Yokohama National University

横滨国立大学

Every 4-connected graph with crossing number 2 is   hamiltonian

Chair:Hao Sun

10:15-10:45

Guantao Chen  

Georgia State University

佐治亚州立大学

Progress on Goldberg’s conjecture

10:45-11:15

Shinya Fujita

Yokohama City University

横滨城市大学

Some recent results on safe sets in graphs

11:15-11:45

Xiangqian Zhou

Wright State University

莱特州立大学

Induction for 4-connected matroids and

graphs

Sunday, July 29, 14:30 PM – 17:45 PM    Session#1 in Room: 107,Tianjiabing Building  

2018年7月29日下午:分组学术活动(分组1: 城西校区科技楼7楼报告厅)

Chair:Ruihu Li

14:30-15:00

Baoyindureng Wu

Xinjiang University

新疆大学

2-Packing number of graphs

15:00-15:30

Yinkui Li

Qinghai Nationalities University

青海民族大学

Cycle multiplicity of some total graphs

15:30-16:00

Hongmei Yao

Harbin Engineering   University

哈尔滨工程大学

Singular value inclusion sets of rectangular tensors

Chair: Changjiang Bu

16:15-16:45

Shenggui Zhang

Northwestern   Polytechnical Uniwersity

西北工业大学

Compatible Eulerian and spanning circuits in   edge-colored graphs

16:45-17:15

Zemin Jin

Zhejiang Normal University

浙江师范大学

Anti-Ramsey number of cliques

17:15-17:45

Jinyu Zou

Qinghai Normal   University

青海师范大学

Gallai Ramsey number for books

Sunday, July 29, 14:30 PM – 17:45 PM    Session#2 in Room:204,Tianjiabing Building  

2018年7月29日下午, 分组2:城西校区田家炳楼2楼会议室)

Chair:Jianhua Tu

14:30-15:00

Xiaoyan Zhang

Nanjing Normal University

南京师范大学

Max -3- Cut with Limited Unbalance and Application in   Scheduling via   Complex Semidefinite Programming

15:00-15:30

Guanqin Lian

Fujiang Normal   University

福建师范大学

Charaterization of diagnosabilities on the bounded PMC   model

15:30-16:00

Shujing Wang

Central China Normal

University

华中师范大学

On σ-span and F-span of trees and binary trees

Chair:Zhixia Xu

16:15-16:45

Jiuying Dong

Jiangxi University of Finance and Economics

江西财经大学

Some results about t-tone k-coloring of graphs

16:45-17:15

Hong Chang

Nankai University

南开大学

Proper index of graphs

17:15-17:45

Xiaoyu Zhu

Nankai University

南开大学

(k,l)-Rainbow connectivity

Sunday, July 29, 14:30 PM – 17:45 PM    Session#3   in Room: 304,Tianjiabing Building  

2018年7月29日下午, 分组3:城西校区田家炳楼3楼会议室)

Chair:Xiangjuan Yao

14:30-15:00

Weifan Wang

Zhejiang Normal   University

浙江师范大学

Linear 2-Arboricity of Graphs

15:00-15:30

Bofeng Huo

Qinghai Normal University

青海师范大学

Spanning cycles in regular matroids without 3-circuits   and small cocircuits

15:30-16:00

Jianhua Tu

Beijng University of Chemical Technology

北京化工大学

A multi-start iterated greedy algorithm for the minimum weight vertex cover P_3 problem

Chair:Jianfeng Wang

16:15-16:45

Jiang Zhou

Harbin Engineering   University

哈尔滨工程大学

Resistance distance and Kirchhoff index of graphs

16:45-17:15

Bo Deng

Qinghai Normal University

青海师范大学

On signless Laplacian borderenergetic graphs

17:15-17:45

Qingqiong Cai

Nankai University

南开大学

Sum of weighted distances in trees

Sunday, July 29, 14:30 PM – 17:45 PM   Session#4 in Room: 703, Science Building

2018年7月29日下午:分组学术活动(分组4:城西校区田家炳楼3楼会议室)

Chair:Biao Zhao

14:30-15:00

Hong Bian

Xinjiang Normal University

新疆师范大学

Routing and reliability in delay tolerant netwoks based on sandpile model

15:00-15:30

Fei Huang

Zhengzhou University

郑州大学

Characterization of 2-SPC cubic graphs

15:30-16:00

Zhonglin Ye

Shaanxi Normal University

陕西师范大学

Network representation learning using the optimization   of neighboring vertex and relation

model

Chair:He Chen

16:15-16:45

Guojun Li

Georgia University

To be updated待定

16:45-17:15

Limei Lin

Fujian Agriculture and Forestry University

福建农林大学

The Relationship between extra connectivity and   conditional diagnosability of regular graphs

17:15-17:45

Jingshu Zhang

Nankai University

南开大学

Tight Nordhaus-Gaddum-type upper

bound for total-rainbow connection

number of graphs

17:45-18:45

Guihai Yu

Guizhou University of Finance and Economics

贵州财经大学

Immanant of (hyper-)graphs


版权所有:西安交通大学数学与数学技术研究院  设计与制作:西安交通大学数据与信息中心
地址:陕西省西安市碑林区咸宁西路28号  邮编:710049