首页|Distance Signatures of Extended and Co-extended Incidence Graphs of Affine Designs

Distance Signatures of Extended and Co-extended Incidence Graphs of Affine Designs

扫码查看
原文链接
  • NETL
  • NSTL
  • 万方数据
  • 维普
The distance matrix of a connected graph G,denoted by D(G),is the matrix whose rows and columns are indexed by the vertex set V(G)such that the(vi,Vj)-entry is d(vi,Vj),where Vi,Vj ∈ V(G).The distance signature sig(D(G))of G is the inertia of D(G).In this paper,we determine the distance signature of the extended(co-extended)incidence graph of an affine design.Furthermore,we state that an open Graffiti conjecture is true for the extended(co-extended)incidence graphs of affine designs by investigating the lower bound of the matching number.

distance signatureextended incidence graphsco-extended incidence graphsaffine designs

Xu Yang、Xiaomin Zhu、Jing Chen

展开 >

School of Statistics and Mathematics Shanghai Lixin University of Accounting and Finance,Shanghai 201209,China

College of Sciences,Shanghai Institute of Technology,Shanghai 201418,China

School of Mathematics and Statistics,Shandong Normal University,Jinan 250358,China

National Natural Science Foundation of ChinaNational Natural Science Foundation of ChinaNational Natural Science Foundation of ChinaTaishan Scholars Program of Shandong Province

122713111210141012201414

2023

10.1142/S1005386723000287

代数集刊(英文版)

代数集刊(英文版)

CSCD北大核心
ISSN：1005-3867
年,卷(期)：2023.30(2)
  • 17