位置：成果数据库 > 期刊 > 期刊详情页
The Triangle-Free Graphs with Rank 6
  • ISSN号：2095-2651
  • 期刊名称：《数学研究及应用：英文版》
  • 时间：0
  • 分类：O123.1[理学—数学;理学—基础数学] O157.5[理学—数学;理学—基础数学]
  • 作者机构：[1]School of Mathematical Sciences, Anhui University, Anhui 230601, P. R. China
  • 相关基金：Supported by National Natural Science Foundation of China （Grant Nos. 11071002; 11371028）, Program for New Century Excellent Talents in University （Grant No. NCET-10-0001）, Key Project of Chinese Ministry of Education （Grant No. 210091）, Scientific Research Fund for Fostering Distinguished Young Scholars of Anhui University （Grant No. KJJQ1001）, Academic Innovation Team of Anhui University Project （Grant No. KJTD001B）.
作者： Long WANG Yizheng FAN Yi WANG[1]
关键词： 三角形, FREE图, 矩阵A, 邻接, graph, rank, nullity.
中文摘要：

The rank of a graph G is defined to be the rank of its adjacency matrix A(G).In this paper we characterize all connected triangle-free graphs with rank 6.

英文摘要：

The rank of a graph G is defined to be the rank of its adjacency matrix A（G）. In this paper we characterize all connected triangle-free graphs with rank 6.

同期刊论文项目
谱图理论专题及其在医学图像配准中的应用
期刊论文 49 会议论文 1
谱图理论及其在压缩感知中的应用
期刊论文 3
同项目期刊论文
基于NSCT与形状特征的遥感影像道路提取
Point Pattern Matching Based on Spectra of Directed Graphs
On the least eigenvalue of graphs with cut vertices
Edge bipartiteness and signless Laplacian spread of graphs
The Least Eigenvalue of Graphs
The least eigenvalues of the signless Laplacian of non-bipartite graphs with pendant vertices
基于近似距离序的重复模式图像匹配算法
一种结合几何相容性分析的谱匹配算法
A note on the nullity of unicyclic signed graphs
Spectral matching algorithm based on nonsubsampled contourlet transform and scale-invariant feature
A Unified Approach to Maximizing the Spectral Radii of the Complements of Graphs with Small Dimensio
The spectrum of a graph obtained from copies of a generalized Bethe tree and a complete graph
The least eigenvalue of the complements of trees
Spectral Moment of Random Graphs
Spectral radii of unicyclic graphs with fixed number of cut vertices
The Least Eigenvalue of Graphs with Cut Edges
基于线图Q-谱的点模式匹配算法
基于局部相对形状上下文与Q-谱的点模式匹配算法
Bipartiteness and the least eigenvalue of signless Laplacian of graphs
The least eigenvalue of signless Laplacian of graphs under perturbation
The chromatic number and the least eigenvalue of a graph
Estrada Index of Random Graphs
The minimum rank of universal adjacency matrices
On Wiener Polarity Index of Cactus Graphs
The nullity of bicyclic signed graphs
点模式匹配——基于谱描述子的算法
基于多谱特征表示的点模式匹配算法
一种基于NSCT和SIFT的遥感图像配准算法
基于拟Laplace谱的形状表示与聚类
The signature of line graphs and power trees
Energy Conditions for Hamiltonicity of Graphs
The least eigenvalue of graphs whose complements are 2-vertex or 2-edge connected
On the nullity of the line graph of unicyclic graph with depth one
The Distance Coloring of Graphs
四叉树分解的图像插值
Adaptive Exponential Synchronization of Coupled Complex Networks on General Graphs
仙人掌图的Wiener极化指数
连通图的Harary指数上界及其极图
具有n-3个悬挂点的树的距离无符号拉普拉斯谱半径
最大化小维数图的补的谱半径的统一方法
图的哈密尔顿性的谱条件（英文）
随机图的谱矩
给定边连通度的图的最小距离谱半径
基于改进光流算法的机器人目标跟踪系统
由广义Bethe树和完全图所构造的图的谱
A Lower Bound for the Distance Signless Laplacian Spectral Radius of Graphs in Terms of Chromatic Number
Some notes on the spectral perturbations of the signless Laplacian of a graph
基于谱特征的图像匹配算法
A Lower Bound for the Distance Signless Laplacian Spectral Radius of Graphs in Terms of Chromatic Number
期刊信息
  • 《数学研究及应用：英文版》
  • 中国科技核心期刊
  • 主管单位:国家教育部
  • 主办单位:大连理工大学
  • 主编：王仁宏
  • 地址：大连理工大学应用数学系
  • 邮编：116024
  • 邮箱：
  • 电话：0411-84707392
  • 国际标准刊号：ISSN：2095-2651
  • 国内统一刊号：ISSN：21-1579/O1
  • 邮发代号:8-92
  • 获奖情况:
  • 1998年大连市优秀期刊奖,2000年大连市优秀期刊奖
  • 国内外数据库收录:
  • 俄罗斯文摘杂志,美国数学评论（网络版）,德国数学文摘,日本日本科学技术振兴机构数据库,中国中国科技核心期刊
  • 被引量:36