Javascript must be enabled to continue!
Graph-Theoretical Indices based on Simple, General and Complete Graphs
View through CrossRef
Valence molecular connectivity indices are based on the concept of valence delta, d v, that can be derived from general chemical graphs or chemical pseudographs. A general graph or pseudograph has multiple edges and loops and can be used to encode, through the valence delta, chemical entities. Two graph-theoretical concepts derived from chemical pseudographs are the intrinsic (I) and the electrotopological state (E) values, which are the used to define the valence delta of the pseudoconnectivity indices, ?I,S. Complete graphs encode, through a new valence delta, the core electrons of any atoms in a molecule. The connectivity indices, either valence connectivity or pseudoconnectivity, are the starting point to develop the dual connectivity indices. The dual indices show that not only can they assume negative values but also cover a wide range of numerical values. The central parameter of the molecular connectivity theory, the valence delta, defines a completely new set of connectivity indices, which can be distinguished by their configuration and advantageously used to model different properties and activities of compounds.
Title: Graph-Theoretical Indices based on Simple, General and Complete Graphs
Description:
Valence molecular connectivity indices are based on the concept of valence delta, d v, that can be derived from general chemical graphs or chemical pseudographs.
A general graph or pseudograph has multiple edges and loops and can be used to encode, through the valence delta, chemical entities.
Two graph-theoretical concepts derived from chemical pseudographs are the intrinsic (I) and the electrotopological state (E) values, which are the used to define the valence delta of the pseudoconnectivity indices, ?I,S.
Complete graphs encode, through a new valence delta, the core electrons of any atoms in a molecule.
The connectivity indices, either valence connectivity or pseudoconnectivity, are the starting point to develop the dual connectivity indices.
The dual indices show that not only can they assume negative values but also cover a wide range of numerical values.
The central parameter of the molecular connectivity theory, the valence delta, defines a completely new set of connectivity indices, which can be distinguished by their configuration and advantageously used to model different properties and activities of compounds.
Related Results
Twilight graphs
Twilight graphs
AbstractThis paper deals primarily with countable, simple, connected graphs and the following two conditions which are trivially satisfied if the graphs are finite:(a) there is an ...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Exploring Large Language Models Integration in the Histopathologic Diagnosis of Skin Diseases: A Comparative Study
Exploring Large Language Models Integration in the Histopathologic Diagnosis of Skin Diseases: A Comparative Study
Abstract
Introduction
The exact manner in which large language models (LLMs) will be integrated into pathology is not yet fully comprehended. This study examines the accuracy, bene...
Subgraph Mining
Subgraph Mining
The amount of available data is increasing very fast. With this data, the desire for data mining is also growing. More and larger databases have to be searched to find interesting ...
Building Multiple Classifier Systems Using Linear Combinations of Reduced Graphs
Building Multiple Classifier Systems Using Linear Combinations of Reduced Graphs
AbstractDespite great efforts done in research in the last decades, the classification of general graphs, i.e., graphs with unconstrained labeling and structure, remains a challeng...
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract
Accurately predicting drug sensitivity and understanding what is driving it are major challenges in drug discovery. Graphs are a natural framework for captu...
Drug–target affinity prediction with extended graph learning-convolutional networks
Drug–target affinity prediction with extended graph learning-convolutional networks
Abstract
Background
High-performance computing plays a pivotal role in computer-aided drug design, a field that holds significant promise in pharmac...
Realizing the Asymmetric Index of a Graph
Realizing the Asymmetric Index of a Graph
A graph G is asymmetric if its automorphism group is trivial. Asymmetric graphs were introduced by Erd\H{o}s and R\'{e}nyi Erdos [1]. They suggested the problem of starting with ...

