图组成的距离谱

IF 0.6 3区数学 Q3 MATHEMATICS

Ars Mathematica Contemporanea Pub Date : 2009-06-02 DOI:10.26493/1855-3974.103.E09

Indulal Gopalapillai

{"title":"图组成的距离谱","authors":"Indulal Gopalapillai","doi":"10.26493/1855-3974.103.E09","DOIUrl":null,"url":null,"abstract":"The D -eigenvalues μ 1 , μ 2 , ..., μ p of a graph G are the eigenvalues of its distance matrix D and form the distance spectrum or the D -spectrum. In this paper we obtain the D -spectrum of the cartesian product if two distance regular graphs. The D -spectrum of the lexicographic product G [ H ] of two graphs G and H when H is regular is also obtained. The D -eigenvalues of the Hamming graphs Ham( d, n ) of diameter d and order n d and those of the C 4 nanotori, T k , m , C 4 , are determined.","PeriodicalId":49239,"journal":{"name":"Ars Mathematica Contemporanea","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2009-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"title\":\"Distance spectrum of graph compositions\",\"authors\":\"Indulal Gopalapillai\",\"doi\":\"10.26493/1855-3974.103.E09\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The D -eigenvalues μ 1 , μ 2 , ..., μ p of a graph G are the eigenvalues of its distance matrix D and form the distance spectrum or the D -spectrum. In this paper we obtain the D -spectrum of the cartesian product if two distance regular graphs. The D -spectrum of the lexicographic product G [ H ] of two graphs G and H when H is regular is also obtained. The D -eigenvalues of the Hamming graphs Ham( d, n ) of diameter d and order n d and those of the C 4 nanotori, T k , m , C 4 , are determined.\",\"PeriodicalId\":49239,\"journal\":{\"name\":\"Ars Mathematica Contemporanea\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2009-06-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ars Mathematica Contemporanea\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.26493/1855-3974.103.E09\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ars Mathematica Contemporanea","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.26493/1855-3974.103.E09","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 28

摘要

D特征值μ 1， μ 2，…， μ p是图G的距离矩阵D的特征值，构成距离谱或D谱。本文得到了两个距离正则图笛卡尔积的D谱。还得到了两个图G和H在H为正则时的字典积G [H]的D谱。确定了直径为D阶为n D的Hamming图Ham(D, n)和c4纳米环tk, m, c4的D特征值。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Distance spectrum of graph compositions

The D -eigenvalues μ 1 , μ 2 , ..., μ p of a graph G are the eigenvalues of its distance matrix D and form the distance spectrum or the D -spectrum. In this paper we obtain the D -spectrum of the cartesian product if two distance regular graphs. The D -spectrum of the lexicographic product G [ H ] of two graphs G and H when H is regular is also obtained. The D -eigenvalues of the Hamming graphs Ham( d, n ) of diameter d and order n d and those of the C 4 nanotori, T k , m , C 4 , are determined.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Ars Mathematica Contemporanea MATHEMATICS, APPLIED-MATHEMATICS

CiteScore

1.70

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： Ars mathematica contemporanea will publish high-quality articles in contemporary mathematics that arise from the discrete and concrete mathematics paradigm. It will favor themes that combine at least two different fields of mathematics. In particular, we welcome papers intersecting discrete mathematics with other branches of mathematics, such as algebra, geometry, topology, theoretical computer science, and combinatorics. The name of the journal was chosen carefully. Symmetry is certainly a theme that is quite welcome to the journal, as it is through symmetry that mathematics comes closest to art.