Results 41 to 50 of about 544,762 (274)
Strong Total Monophonic Problems in Product Graphs, Networks, and Its Computational Complexity
Journal of Mathematics, 2022 Let G be a graph with vertex set as VG and edge set as EG which is simple as well as connected. The problem of strong total monophonic set is to find the set of vertices T⊆VG, which contains no isolated vertices, and all the vertices in VG\T lie on a ...
Eddith Sarah Varghese +5 more
doaj +1 more source
Derivable Single Valued Neutrosophic Graphs Based on KM-Fuzzy Metric
IEEE Access, 2020 In this paper we consider the concept of KM-fuzzy metric spaces and we introduce a novel concept of KM-single valued neutrosophic metric graphs based on KM-fuzzy metric spaces.
Mohammad Hamidi, Florentin Smarandache
doaj +1 more source
Computing Analysis of Zagreb Indices for Generalized Sum Graphs under Strong Product
Journal of Chemistry, 2021 Numerous studies based on mathematical models and tools indicate that there is a strong inherent relationship between the chemical properties of the chemical compounds and drugs with their molecular structures.
Muhammad Javaid +3 more
doaj +1 more source
Strong resolving partitions for strong product graphs and Cartesian product graphs
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
The metric dimension of strong product graphs [PDF]
Carpathian Journal of Mathematics, 2015 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.
Rodríguez Velázquez, Juan A. +3 more
openaire +4 more sources
The partition dimension of strong product graphs and Cartesian product graphs
Discrete Mathematics, 2014 15 ...
Ismael González Yero +3 more
openaire +3 more sources
The Restricted Edge-Connectivity of Strong Product Graphs
AxiomsThe restricted edge-connectivity of a connected graph G, denoted by λ′(G), if it exists, is the minimum cardinality of a set of edges whose deletion makes G disconnected, and each component has at least two vertices.
Hazhe Ye, Yingzhi Tian
doaj +1 more source
Intuitionistic Fuzzy Graphs with Categorical Properties
Fuzzy Information and Engineering, 2015 The main purpose of this paper is to show the rationality of some operations, defined or to be defined, on intuitionistic fuzzy graphs. Firstly, three kinds of new product operations (called direct product, lexicographic product, and strong product) are ...
Hossein Rashmanlou +3 more
doaj +1 more source
Dimensi Metrik Kuat Lokal Graf Hasil Operasi Kali Kartesian
Contemporary Mathematics and Applications (ConMathA), 2020 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 ...
Nurma Ariska Sutardji +2 more
doaj +1 more source
Estimation of Laplacian spectra of direct and strong product graphs
, 2015 Calculating a product of multiple graphs has been studied in mathematics, engineering, computer science, and more recently in network science, particularly in the context of multilayer networks. One of the important questions to be addressed in this area
Sayama, Hiroki
core +1 more source