Eccentric Distance Sum in Chemical Compounds Graph Using Domination

Raji, M. and Jayalalitha, G. (2021) Eccentric Distance Sum in Chemical Compounds Graph Using Domination. In: Advances in Intelligent Systems and Computing. Springer, pp. 23-33.

[thumbnail of bok_978-981-33-4389-4-40-50.pdf] Archive
bok_978-981-33-4389-4-40-50.pdf

Download (508kB)

Abstract

Any graphical representation of combined points and connecting lines is called a graph. Railway networks, mobile communication networks and any other traffic connections are more often examples. The representation of an atomic structure by a graph, which is connected, undirected and their vertices represent atoms and their edges are bondings, is an important application of graph theory field called chemical graph theory. Chemical graph theory is often used through the interpretation of chemical structures into numerical graph invariants. Graph invariant is a property of
the graph that is preserved by isomorphism. Eccentric distance sum is a novel graph invariant which can be used in chemical compounds structure, some drug designs and molecular documentation. Eccentric distance sum presents a huge potential for structure relationships. This paper shows eccentric distance sum in the graph of chemical compounds that depends on minimum dominating distance matrix and
then computes total eccentricity of linear benzenoid system (LBS) for h hexagons where h ≤ 5.

Item Type: Book Section
Subjects: Mathematics > Graph Theory
Divisions: Mathematics
Depositing User: Mr IR Admin
Date Deposited: 10 Oct 2024 06:13
Last Modified: 10 Oct 2024 06:13
URI: https://ir.vistas.ac.in/id/eprint/9645

Actions (login required)

View Item
View Item