Effects on distance energy of some special complete multipartite graphs by embedding an edge

IF 0.5 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Acta Informatica Pub Date : 2025-05-22 DOI:10.1007/s00236-025-00491-1

Masood Ur Rehman, Muhammad Ajmal

引用次数: 0

Abstract

The distance energy of a simple undirected graph \(\mathcal {G}\), denoted by \(\mathcal {E}_D(\mathcal {G})\), is the sum of the absolute values of the eigenvalues of the distance matrix \(D(\mathcal {G})\) of \(\mathcal {G}\). In this paper, we study the effects on distance energy of some special complete t-partite graphs due to embedding an edge. This paper is motivated by the study in a 2022 paper by Wang and Meng.

查看原文本刊更多论文

嵌入边对几种特殊完全多部图距离能量的影响

一个简单无向图\(\mathcal {G}\)的距离能量，用\(\mathcal {E}_D(\mathcal {G})\)表示，是\(\mathcal {G}\)的距离矩阵\(D(\mathcal {G})\)的特征值的绝对值之和。本文研究了一些特殊的完全t部图中嵌入一条边对距离能量的影响。本文的研究灵感来源于Wang和b孟在2022年的一篇论文中的研究。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Acta Informatica 工程技术-计算机：信息系统

CiteScore

2.40

自引率

16.70%

发文量

审稿时长

>12 weeks

期刊介绍： Acta Informatica provides international dissemination of articles on formal methods for the design and analysis of programs, computing systems and information structures, as well as related fields of Theoretical Computer Science such as Automata Theory, Logic in Computer Science, and Algorithmics. Topics of interest include: • semantics of programming languages • models and modeling languages for concurrent, distributed, reactive and mobile systems • models and modeling languages for timed, hybrid and probabilistic systems • specification, program analysis and verification • model checking and theorem proving • modal, temporal, first- and higher-order logics, and their variants • constraint logic, SAT/SMT-solving techniques • theoretical aspects of databases, semi-structured data and finite model theory • theoretical aspects of artificial intelligence, knowledge representation, description logic • automata theory, formal languages, term and graph rewriting • game-based models, synthesis • type theory, typed calculi • algebraic, coalgebraic and categorical methods • formal aspects of performance, dependability and reliability analysis • foundations of information and network security • parallel, distributed and randomized algorithms • design and analysis of algorithms • foundations of network and communication protocols.