scholarly journals Hubungan Dimensi Metrik Ketetanggaan dan Dimensi Metrik Ketetanggan Lokal Graf Hasil Operasi Kali Korona

2020 ◽  
Vol 2 (1) ◽  
pp. 13
Author(s):  
Virdina Rahmayanti ◽  
Moh. Imam Utoyo ◽  
Liliek Susilowati
Keyword(s):  
Connected Graph ◽  
Basic Characteristic ◽  
Metric Dimension ◽  
Product Graph ◽  
Graph Operations ◽  
Trivial Graph ◽  
Corona Product

Adjacency metric dimension and local adjacency metric dimension are the development of metric dimension. The purpose of this research is to determine the adjacency metric dimension of corona graph between any connected graph G and non-trivial graph H denoted by dimA(G⊙H), to determine the local adjacency metric dimension of corona graph between any connected graph G and non-trivial graph H denoted by dimA,l(G⊙H), and to determine the correlation between adjacency metric dimension and local adjacency metric dimension of corona product graph operations. In this research, it is found out that the value of adjacency metric dimension of G⊙H graph is affected by the basic characteristic of H and the domination characteristic. Meanwhile, the value of local adjacency metric dimension of G⊙H graph is only affected by the basic characteristic of H Futhermore, it is found a correlation of adjacency metric dimension and local adjacency metric dimension of corona product graph between any connected graph G and non-trivial graph H.

scholarly journals Dimensi Metrik Kuat Lokal Graf Hasil Operasi Kali Kartesian

2020 ◽  
Vol 1 (2) ◽  
pp. 64
Author(s):  
Nurma Ariska Sutardji ◽  
Liliek Susilowati ◽  
Utami Dyah Purwati
Keyword(s):  
Graph Theory ◽  
Cartesian Product ◽  
Metric Dimension ◽  
Star Graph ◽  
Product Graph ◽  
Path Graph ◽  
Strong Metric Dimension ◽  
Metric Dimensions ◽  
Development Result ◽  
Corona Product

The strong local metric dimension is the development result of a strong metric dimension study, one of the study topics in graph theory. Some of graphs that have been discovered about strong local metric dimension are path graph, star graph, complete graph, cycle graphs, and the result corona product graph. In the previous study have been built about strong local metric dimensions of corona product graph. The purpose of this research is to determine the strong local metric dimension of cartesian product graph between any connected graph G and H, denoted by dimsl (G x H). In this research, local metric dimension of G x H is influenced by local strong metric dimension of graph G and local strong metric dimension of graph H. Graph G and graph H has at least two order.

scholarly journals Upper Bounds for the Modified Second Multiplicative Zagreb Index of Graph Operations

2016 ◽  
Vol 17 ◽  
pp. 10-16
Author(s):  
Bommanahal Basavanagoud ◽  
Shreekant Patil
Keyword(s):  
Connected Graph ◽  
Cartesian Product ◽  
Upper Bounds ◽  
Zagreb Index ◽  
Graph Operations ◽  
Product Composition ◽  
Degree Of A Vertex ◽  
Product Of Graphs ◽  
Corona Product

The modified second multiplicative Zagreb index of a connected graph G, denoted by $\prod_{2}^{*}(G)$, is defined as $\prod_{2}^{*}(G)=\prod \limits_{uv\in E(G)}[d_{G}(u)+d_{G}(v)]^{[d_{G}(u)+d_{G}(v)]}$ where $d_{G}(z)$ is the degree of a vertex z in G. In this paper, we present some upper bounds for the modified second multiplicative Zagreb index of graph operations such as union, join, Cartesian product, composition and corona product of graphs are derived.The modified second multiplicative Zagreb index of aconnected graph , denoted by , is defined as where is the degree of avertex in . In this paper, we present some upper bounds for themodified second multiplicative Zagreb index of graph operations such as union,join, Cartesian product, composition and corona product of graphs are derived.

scholarly journals The Reciprocal Complementary Wiener Number of Graph Operations

2021 ◽  
Vol 45 (01) ◽  
pp. 139-154
Author(s):  
R. NASIRI ◽  
A. NAKHAEI ◽  
A. R. SHOJAEIFARD
Keyword(s):  
Connected Graph ◽  
Cartesian Product ◽  
Symmetric Difference ◽  
Graph Operations ◽  
Strong Product ◽  
Product Composition ◽  
Wiener Number ◽  
Corona Product

The reciprocal complementary Wiener number of a connected graph G is defined as ∑ {x,y}⊆V (G) 1 D+1-−-dG(x,y), where D is the diameter of G and dG(x,y) is the distance between vertices x and y. In this work, we study the reciprocal complementary Wiener number of various graph operations such as join, Cartesian product, composition, strong product, disjunction, symmetric difference, corona product, splice and link of graphs.

scholarly journals DIMENSI METRIK KETETANGGAAN LOKAL GRAF HASIL OPERASI k-COMB

2019 ◽  
Vol 1 (1) ◽  
pp. 1
Author(s):  
Fryda Arum Pratama ◽  
Liliek Susilowati ◽  
Moh. Imam Utoyo
Keyword(s):  
Complete Graph ◽  
Connected Graph ◽  
Metric Dimension ◽  
Star Graph ◽  
K Value ◽  
Product Graph ◽  
Path Graph ◽  
Dominating Number ◽  
Cycle Graph

Research on the local adjacency metric dimension has not been found in all operations of the graph, one of them is comb product graph. The purpose of this research was to determine the local adjacency metric dimension of k-comb product graph and level  comb product graph between any connected graph G and H. In this research graph G and graph H such as cycle graph, complete graph, path graph, and star graph. K-comb product graph between any graph G and H denoted by GokH. While level k comb product graph between any graph G and H denoted by GokH.In this research, local adjacency metric dimension of GokSm graph only dependent to multiplication of the cardinality of V(G) and many of k value, while GokKm graph and GokCm graph is dependent to dominating number of G and multiplication of the cardinality of V(G), many of k value, and local adjacency metric dimension of Km graph or Cm graph. And then, local adjacency metric dimension of GokSm graph only dependent to the cardinality of V(Gok-1Sm), while GokKm graph and GokCm graph is dependent to dominating number of G and multiplication of the local adjacency metric dimension of Km graph or Cm graph with cardinality of V(Gok-1Km) or V(Gok-1Cm). 

scholarly journals Inverse sum indeg coindex of graphs

2019 ◽  
Vol 11 (2) ◽  
pp. 399-406
Author(s):  
K. Pattabiraman
Keyword(s):  
Connected Graph ◽  
Upper Bounds ◽  
Product Graph ◽  
Degree Of A Vertex ◽  
Simple Connected Graph ◽  
Corona Product

The inverse sum indeg coindex $\overline{ISI}(G)$ of a simple connected graph $G$ is defined as the sum of the terms $\frac{d_G(u)d_G(v)}{d_G(u)+d_G(v)}$ over all edges $uv$ not in $G,$ where $d_G(u)$ denotes the degree of a vertex $u$ of $G.$ In this paper, we present the upper bounds on inverse sum indeg coindex of edge corona product graph and Mycielskian graph. In addition, we obtain the exact value of both inverse sum indeg index and its coindex of a double graph.

scholarly journals The metric dimension of strong product graphs

2015 ◽  
Vol 31 (2) ◽  
pp. 261-268
Author(s):  
JUAN A. RODRIGUEZ-VELAZQUEZ ◽  
◽  
DOROTA KUZIAK ◽  
ISMAEL G. YERO ◽  
JOSE M. SIGARRETA ◽  
...  
Keyword(s):  
Connected Graph ◽  
Metric Dimension ◽  
Np Hard ◽  
Strong Product ◽  
Product Graphs ◽  
Metric Basis

For an ordered subset S = {s1, s2, . . . sk} of vertices in a connected graph G, the metric representation of a vertex u with respect to the set S is the k-vector r(u|S) = (dG(v, s1), dG(v, s2), . . . , dG(v, sk)), where dG(x, y) represents the distance between the vertices x and y. The set S is a metric generator for G if every two different vertices of G have distinct metric representations with respect to S. A minimum metric generator is called a metric basis for G and its cardinality, dim(G), the metric dimension of G. It is well known that the problem of finding the metric dimension of a graph is NP-Hard. In this paper we obtain closed formulae and tight bounds for the metric dimension of strong product graphs.

scholarly journals HF-Index and Y-Index of Some New Graph of Operations

2022 ◽  
pp. 28-33
Author(s):  
Dr. S. Nagarajan ◽  
◽  
G. Kayalvizhi ◽  
G. Priyadharsini ◽  
◽  
...  
Keyword(s):  
Cartesian Product ◽  
Graph Operations ◽  
Join Of Graphs ◽  
Product Of Graphs ◽  
Corona Product

In this paper we derive HF index of some graph operations containing join, Cartesian Product, Corona Product of graphs and compute the Y index of new operations of graphs related to the join of graphs.

scholarly journals Joins, coronas and their vertex-edge Wiener polynomials

2016 ◽  
Vol 47 (2) ◽  
pp. 163-178
Author(s):  
Mahdieh Azari ◽  
Ali Iranmanesh
Keyword(s):  
Generating Function ◽  
Connected Graph ◽  
Wiener Index ◽  
First Derivative ◽  
Sum Of Distances ◽  
Simple Connected Graph ◽  
Product Of Graphs ◽  
Corona Product

The vertex-edge Wiener index of a simple connected graph $G$ is defined as the sum of distances between vertices and edges of $G$. The vertex-edge Wiener polynomial of $G$ is a generating function whose first derivative is a $q-$analog of the vertex-edge Wiener index. Two possible distances $D_1(u, e|G)$ and $D_2(u, e|G)$ between a vertex $u$ and an edge $e$ of $G$ can be considered and corresponding to them, the first and second vertex-edge Wiener indices of $G$, and the first and second vertex-edge Wiener polynomials of $G$ are introduced. In this paper, we study the behavior of these indices and polynomials under the join and corona product of graphs. Results are applied for some classes of graphs such as suspensions, bottlenecks, and thorny graphs.

scholarly journals Metric basis and metric dimension of 1-pentagonal carbon nanocone networks

2020 ◽  
Vol 10 (1) ◽  
Author(s):  
Zafar Hussain ◽  
Mobeen Munir ◽  
Ashfaq Ahmad ◽  
Maqbool Chaudhary ◽  
Junaid Alam Khan ◽  
...  
Keyword(s):  
Combinatorial Chemistry ◽  
Connected Graph ◽  
Cardinal Number ◽  
Metric Dimension ◽  
Molecular Topology ◽  
Resolving Set ◽  
Computer Chemistry ◽  
Carbon Nanocones ◽  
Vertex Set ◽  
Metric Basis

AbstractResolving set and metric basis has become an integral part in combinatorial chemistry and molecular topology. It has a lot of applications in computer, chemistry, pharmacy and mathematical disciplines. A subset S of the vertex set V of a connected graph G resolves G if all vertices of G have different representations with respect to S. A metric basis for G is a resolving set having minimum cardinal number and this cardinal number is called the metric dimension of G. In present work, we find a metric basis and also metric dimension of 1-pentagonal carbon nanocones. We conclude that only three vertices are minimal requirement for the unique identification of all vertices in this network.

scholarly journals Edge Metric Dimension of Some Graph Operations

2019 ◽  
Vol 43 (3) ◽  
pp. 2465-2477 ◽  
Author(s):  
Iztok Peterin ◽  
Ismael G. Yero
Keyword(s):  
Metric Dimension ◽  
Graph Operations
Sign in / Sign up

Export Citation Format

Share Document