Results 31 to 40 of about 5,134,655 (243)
Clustering Coefficient of Lexicographic Products
Clustering coefficient measures are key complex network analysis tools. We examine local and global clustering coefficient measures with respect to the lexicographic graph product. As a preliminary condition, we analyze the $K_3$ subgraph structure focused on vertex inclusion with respect to the product graph. From this structure, we determine both the
Melissa Holly
openalex +3 more sources
The generalized 3-edge-connectivity of lexicographic product graphs [PDF]
, 2014 The generalized $k$-edge-connectivity $\lambda_k(G)$ of a graph $G$ is a generalization of the concept of edge-connectivity. The lexicographic product of two graphs $G$ and $H$, denoted by $G\circ H$, is an important graph product.
Xueliang Li, Jun Yue, Yan Zhao
openalex +3 more sources
Operations on Neutrosophic Vague Soft Graphs [PDF]
Neutrosophic Sets and Systems, 2022 This article concerns with the neutrosophic vague soft graphs for treating neutrosophic vague soft information by employing the theory of neutrosophic vague soft sets with graphs.
S. Satham Hussain +3 more
doaj +1 more source
Strong Resolving Domination in the Lexicographic Product of Graphs
European Journal of Pure and Applied Mathematics, 2023 Let G be a connected graph. A subset S ⊆ V (G) is a strong resolving dominating set of G if S is a dominating set and for every pair of vertices u, v ∈ V (G), there exists a vertex w ∈ S such that u ∈ IG[v, w] or IG[u, w].
Gerald B. Monsanto +2 more
semanticscholar +1 more source
Metric dimension of lexicographic product of some known graphs [PDF]
Journal of Mahani Mathematical Research, 2023 For an ordered set $W=\{w_1,w_2,\ldots,w_k\}$ of vertices and a vertex $v$ in a connected graph $G$, the ordered $k$-vector $r(v|W):=(d(v,w_1),d(v,w_2),\ldots,d(v,w_k))$ is called the (metric) representation of $v$ with respect to $W$, where $d(x,y ...
Mohsen Jannesari
doaj +1 more source
Spanning Tree Packing of Lexicographic Product of Graphs Resulting from Path and Complete Graphs
Asian Research Journal of Mathematics, 2023 For any graphs G of order n, the spanning tree packing number, denoted by, of a graph G is the maximum number of edge disjoint spanning tree contained in G.
I. Jr.
semanticscholar +1 more source
Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs [PDF]
Fundamenta Informaticae, 2021 The aim of this paper is to obtain closed formulas for the perfect domination number, the Roman domination number and the perfect Roman domination number of lexicographic product graphs.
Abel Cabrera Martínez +2 more
semanticscholar +1 more source
Operations on Neutrosophic Vague Graphs [PDF]
Neutrosophic Sets and Systems, 2020 Neutrosophic graph is a mathematical tool to hold with imprecise and unspecified data. In this manuscript, the operations on neutrosophic vague graphs are introduced. Moreover, Cartesian product, lexicographic product, cross product, strong product and
S. Satham Hussain +3 more
doaj +1 more source
From w-Domination in Graphs to Domination Parameters in Lexicographic Product Graphs
Bulletin of the Malaysian Mathematical Sciences Society, 2023 A wide range of parameters of domination in graphs can be defined and studied through a common approach that was recently introduced in [ https://doi.org/10.26493/1855-3974.2318.fb9 ] under the name of w -domination, where $$w=(w_0,w_1, \dots ,w_l)$$ w =
A. Cabrera-Martínez +2 more
semanticscholar +1 more source
Lexicographic palindromic products
The Art of Discrete and Applied Mathematics, 2022 Summary: A graph \(G\) on \(n\) vertices is \textit{palindromic} if there is a vertex-labeling bijection \(f : V(G) \rightarrow \{1, 2, \dots, n\}\) with the property that for any edge \(vw \in E(G)\), there is an edge \(xy \in E(G)\) for which \(f(x) = n - f(v) + 1\) and \(f(y) = n - f(w) + 1\).
openaire +2 more sources