版权说明 操作指南
首页 > 成果 > 详情

Graphs associated with matrices over finite fields and their endomorphisms in memory of Professor Michael Neumann and Professor Uri Rothblum

认领
导出
下载 Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Huang, Li-Ping;Huang, Zejun;Li, Chi-Kwong;Sze, Nung-Sing*
通讯作者:
Sze, Nung-Sing
作者机构:
[Huang, Li-Ping] Changsha Univ Sci & Technol, Sch Math & Comp Sci, Changsha 410004, Hunan, Peoples R China.
[Huang, Zejun; Sze, Nung-Sing] Hong Kong Polytech Univ, Dept Appl Math, Hong Kong, Hong Kong, Peoples R China.
[Li, Chi-Kwong] Coll William & Mary, Dept Math, Williamsburg, VA 23187 USA.
[Li, Chi-Kwong] Univ Hong Kong, Dept Math, Hong Kong, Hong Kong, Peoples R China.
通讯机构:
[Sze, Nung-Sing] H
Hong Kong Polytech Univ, Dept Appl Math, Hong Kong, Hong Kong, Peoples R China.
语种:
英文
关键词:
Matrix algebra;Networks (circuits);Chromatic number;Endomorphism;Finite fields;Graph;Independence number;Graph theory
期刊:
Linear Algebra and its Applications
ISSN:
0024-3795
年:
2014
卷:
447
页码:
2-25
基金类别:
The research of L.-P. Huang was supported by a National Natural Science Foundation of China (Project 11371072 ) and a Scientific Research Fund of Hunan Provincial Education Department (grant No. 10A002 ). Li and Sze were partially supported by a Hong Kong RGC grant PolyU 502411 ; this grant supported the post-doctoral fellowship of Z. Huang at the Hong Kong Polytechnic University. Li was also supported by a USA NSF grant; he was a visiting professor of the University of Hong Kong in the spring of 2012, an honorary professor of Taiyuan University of Technology (100 Talent Program scholar), and an honorary professor of the Shanghai University. Finally, the authors wish to thank the referee for valuable comments and suggestions and bringing our attention to references [2,14,15,19] .
机构署名:
本校为第一机构
院系归属:
数学与统计学院
摘要:
Let Fm×n be the set of m×n matrices over a field F. Consider a graph G=(Fm×n,∼) with Fm×n as the vertex set such that two vertices A,B∈Fm×n are adjacent if rank(A-B)=1. We study graph properties of G when F is a finite field. In particular, G is a regular connected graph with diameter equal to min{m,n}; it is always Hamiltonian. Furthermore, we determine the independence number, chromatic number and clique number of G. These results are used to characterize the graph endomorphisms of G, which extends Hua's fundamental the...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com