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

On the dot product of graphs over monogenic semigroups

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 8 publications
(8 citation statements)
references
References 15 publications
0
8
0
Order By: Relevance
“…As mentioned in [30], some chemically interesting graphs can be obtained by different graph operations which are applied onto some general or particular graphs, so it is essential to study such graph operations to understand how they are related to the corresponding topological indices of the original graphs. So far, first and second Zagreb indices have been largely studied under some graph operations (see, for instance, [3,8,11,[30][31][32][33][34][35]).…”
Section: Results On Graph Operationsmentioning
confidence: 99%
“…As mentioned in [30], some chemically interesting graphs can be obtained by different graph operations which are applied onto some general or particular graphs, so it is essential to study such graph operations to understand how they are related to the corresponding topological indices of the original graphs. So far, first and second Zagreb indices have been largely studied under some graph operations (see, for instance, [3,8,11,[30][31][32][33][34][35]).…”
Section: Results On Graph Operationsmentioning
confidence: 99%
“…This equality holds if n − k + a > n or a = 0 S n and n − t + b > n or a = 0 S n . Alternatively, all elements of S can be thought to form a matrix [C] (n+1)×(n+1) for n ∈ N, in [12]:…”
Section: Resultsmentioning
confidence: 99%
“…The following result will be used in the rest of the paper: 12]). (S) is always connected and its diameter is equal to 2, that is diam( (S)) = 2.…”
Section: Now Let Us Recall the Definitions Of The Wiener Index And Momentioning
confidence: 99%
See 1 more Smart Citation
“…By utilizing the idea defined in [5,6], the authors obtained a new graph related to monogenic semigroups in [7]. e vertices of this graph are all nonzero elements in S M and for any two different vertices x i and x j where (1 ≤ i, j ≤ n) are linked to each other, if and only if i + j > n. ere are many studies concerning monogenic semigroup graphs which were published by Akgünes ¸et al (see for example [8][9][10]).…”
Section: Introductionmentioning
confidence: 99%