Results 11 to 20 of about 1,185,468 (303)
Factorisation Properties of the Strong Product [PDF]
, 2010 We investigate a number of factorisation conditions in the framework of sets of probability measures, or coherent lower previsions, with finite referential spaces. We show that the so-called strong product constitutes one way to combine a number of marginal coherent lower previsions into an independent joint lower prevision, and we prove that under ...
Gert de Cooman +2 more
openaire +3 more sources
Journal of Combinatorial Theory, Series A, 1994 The paper obtains algebraic structure theorems and properties for the strong Kronecker product of two block matrices, \(M= [M_{ij}]\) and \(N= [N_{jk}]\), where \(i= 1,\dots,r\), \(j= 1,\dots,t\), \(k= 1,\dots,u\), each \(M_{ij}\) is an \(m\times p\) submatrix, each \(N_{jk}\) is an \(n\times q\) matrix, namely: \(M\circ N= [L_{ik}]\), \(i= 1,\dots,r\),
de Launey, Warwick, Seberry, Jennifer
openaire +3 more sources
Gromov Hyperbolicity in Strong Product Graphs [PDF]
The Electronic Journal of Combinatorics, 2013 If X is a geodesic metric space and $x_1,x_2,x_3\in X$, a geodesic triangle $T=\{x_1,x_2,x_3\}$ is the union of the three geodesics $[x_1x_2]$, $[x_2x_3]$ and $[x_3x_1]$ in $X$. The space $X$ is $\delta$-hyperbolic $($in the Gromov sense$)$ if any side of $T$ is contained in a $\delta$-neighborhood of the union of the two other sides, for every ...
Walter Carballosa +3 more
openaire +6 more sources
Bounding the Open k-Monopoly Number of Strong Product Graphs
Discussiones Mathematicae Graph Theory, 2018 Let G = (V, E) be a simple graph without isolated vertices and minimum degree δ, and let k ∈ {1 − ⌈δ/2⌉, . . . , ⌊δ/2⌋} be an integer. Given a set M ⊂ V, a vertex v of G is said to be k-controlled by M if δM(v)≥δG(v)2+k$\delta _M (v) \ge {{\delta _G (v)}
Kuziak Dorota +2 more
doaj +2 more sources
Exact square coloring of graphs resulting from some graph operations and products
AKCE International Journal of Graphs and Combinatorics, 2022 A vertex coloring of a graph [Formula: see text] is called an exact square coloring of G if any pair of vertices at distance 2 receive distinct colors.
Priyamvada, B. S. Panda
doaj +1 more source
Managing Product Features and Customer Satisfaction via Product Development, Product Branding, and Product Packaging: Evidence from CWAY Table Water [PDF]
, 2023 Customer satisfaction has become a source of worry to most organizations, including the table water business. The table water industry is one of the most competitive markets in Nigeria today and due to its portability and affordability, it is seen as a ...
Michael Oyedele Oyenuga ,Ekweogwu Fredrick
core +1 more source
Wiener index of strong product of graphs [PDF]
Opuscula Mathematica, 2018 The Wiener index of a connected graph \(G\) is the sum of distances between all pairs of vertices of \(G\). The strong product is one of the four most investigated graph products.
Iztok Peterin, Petra Žigert Pleteršek
doaj +1 more source
On the Packing Partitioning Problem on Directed Graphs
Mathematics, 2021 This work is aimed to continue studying the packing sets of digraphs via the perspective of partitioning the vertex set of a digraph into packing sets (which can be interpreted as a type of vertex coloring of digraphs) and focused on finding the minimum ...
Babak Samadi, Ismael G. Yero
doaj +1 more source
Radio Labeling for Strong Product K3 ⊠ Pn
IEEE Access, 2020 Many variations of graph labeling has been defined in the literature. e.g., graceful, harmonious and radio labeling etc. In information technology and in data sciences, we need secrecy of data, different channel assignment and accuracy of transmission of
Hengxiao Qi +4 more
doaj +1 more source
Fork-decomposition of strong product of graphs
Ratio Mathematica, 2023 Decomposition of arbitrary graphs into subgraphs of small size is assuming importance in the literature. There are several studies on the isomorphic decomposition of graphs into paths, cycles, trees, stars, sunlet etc.
Samuel Issacraj, Paulraj Joseph
doaj +1 more source