Results 61 to 70 of about 5,793,190 (230)
Four‐Dimensional pp‐Wave Lie Groups and Harmonic Curvature
Mathematische Nachrichten, EarlyView.ABSTRACT We determine all four‐dimensional Lie groups which have harmonic curvature. In parallel, a description of four‐dimensional pp‐wave Lie groups is obtained.
E. García‐Río +2 more
wiley +1 more source
A lexicographic product for signed graphs [PDF]
Australas. J Comb., 2019 Summary: A signed graph is a pair \(\Gamma=(G,\sigma)\), where \(G=(V(G),E(G))\) is a graph and \(\sigma:E(G)\rightarrow\{+1,-1\}\) is the sign function on the edges of \(G\). The notion of composition (also known as lexicographic product) of two signed graphs \(\Gamma\) and \(\Lambda=(H,\tau)\) already exists in literature, yet it fails to map ...
Brunetti M, Cavaleri M, Donno A.
openaire +2 more sources
Comparative Study of Generalized Sum Graphs via Degree-Based Topological Indices
Journal of Mathematics, 2022 In theoretical chemistry, topological indices (TIs) have important role to predict various physical and structural properties of the study under molecular graphs.
Muhammad Javaid +2 more
doaj +1 more source
Pseudo MV-algebras and Lexicographic Product [PDF]
, 2014 We study algebraic conditions when a pseudo MV-algebra is an interval in the lexicographic product of an Abelian unital $\ell$-group and an $\ell$-group that is not necessary Abelian.
Dvurečenskij, Anatolij
core
On the weak Roman domination number of lexicographic product graphs
, 2018 A vertex $v$ of a graph $G=(V,E)$ is said to be undefended with respect to a function $f: V \longrightarrow \{0,1,2\}$ if $f(v)=0$ and $f(u)=0$ for every vertex $u$ adjacent to $v$.
Pérez-Rosés, Hebert +2 more
core +1 more source
Outer-restrained Domination in the Lexicographic Product of Two Graphs
International Journal For Multidisciplinary ResearchLet G be a connected simple graph. A set S⊆V(G) is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in (G)∖S .
Celart A. Tuble +4 more
semanticscholar +1 more source
Domination related parameters in the generalized lexicographic product of graphs [PDF]
Discrete Applied Mathematics, 2020 In this paper we begin an exploration of several domination-related parameters (among which are the total, restrained, total restrained, paired, outer connected and total outer connected domination numbers) in the generalized lexicographic product (GLP ...
Vladimir Samodivkin
semanticscholar +1 more source
Circulant Matrix‐Based Box–Behnken Designs With Economic Run Sizes
Quality and Reliability Engineering International, EarlyView.ABSTRACT We introduce Circulant Matrix‐Based Box–Behnken Designs (CBBDs), a new class of three‐level, second‐order response surface designs constructed using circulant matrix structures. These designs satisfy an enhanced orthogonal minimally aliased (OMA∗${\rm OMA}^*$) property: they retain the classical OMA property—where main effects are orthogonal ...
Tung‐Dinh Pham, Nam‐Ky Nguyen
wiley +1 more source
Outer Independent Double Italian Domination of Some Graph Products
Theory and Applications of Graphs, 2023 An outer independent double Italian dominating function on a graph $G$ is a function $f:V(G)\rightarrow\{0,1,2,3\}$ for which each vertex $x\in V(G)$ with $\color{red}{f(x)\in \{0,1\}}$ then $\sum_{y\in N[x]}f(y)\geqslant 3$ and vertices assigned $0 ...
Rouhollah Jalaei, Doost Ali Mojdeh
doaj +1 more source
The Simultaneous Metric Dimension of Families Composed by Lexicographic Product Graphs
, 2015 Let ${\mathcal G}$ be a graph family defined on a common (labeled) vertex set $V$. A set $S\subseteq V$ is said to be a simultaneous metric generator for ${\cal G}$ if for every $G\in {\cal G}$ and every pair of different vertices $u,v\in V$ there exists
Estrada-Moreno, Alejandro +2 more
core +1 more source