2018
DOI: 10.1016/j.akcej.2017.10.004
|View full text |Cite
|
Sign up to set email alerts
|

The adjacency spectrum of two new operations of graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
5
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 5 publications
0
5
0
Order By: Relevance
“…The Cartesian product of graphs G and H, denoted by G H, is the graph with vertex set operations of graphs may be found in [13]. In 2017, Wang et al [16] proposed the following two operations of graphs and also studied their adjacency spectrum. We reproduce the figure in [16] to make the discussion self expository.…”
Section: The Two New Operations Of Graphsmentioning
confidence: 99%
See 2 more Smart Citations
“…The Cartesian product of graphs G and H, denoted by G H, is the graph with vertex set operations of graphs may be found in [13]. In 2017, Wang et al [16] proposed the following two operations of graphs and also studied their adjacency spectrum. We reproduce the figure in [16] to make the discussion self expository.…”
Section: The Two New Operations Of Graphsmentioning
confidence: 99%
“…In 2017, Wang et al [16] proposed the following two operations of graphs and also studied their adjacency spectrum. We reproduce the figure in [16] to make the discussion self expository.…”
Section: The Two New Operations Of Graphsmentioning
confidence: 99%
See 1 more Smart Citation
“…In Quantitative Structure-Property Relationship (QSPR) and Quantitative Structure-Activity Relationship (QSAR) investigations, these topological descriptors are utilized to estimate the physicochemical and/or biological characteristics of molecules [20,41]. Several degree, spectrum, matching, and distance-based topological descriptors have been suggested and explored in the literature [37,42,5], some of the interesting indices are Sombor index, Steiner Gutman Index, Estrada index and Laplacian Estrada index of a graphs, see [43,38,39,44]. One of the oldest topological indices and most investigated is the Wiener index, after the successful of this index, Gutman et al [16] introduced the generalization of the Wiener index for a acyclic graph known as szeged(Sz) index.…”
Section: Introductionmentioning
confidence: 99%
“…Graph polynomials were utilized in chemistry in conjunction with the molecular orbital theory of unsaturated compounds, and they were also a valuable source of structural descriptors used in constructing structure property models. [7,14,15,33,42]. Distance-based and degree-based graph polynomials are useful because they contain a wealth of information about topological indices.…”
Section: Introductionmentioning
confidence: 99%