Results 21 to 30 of about 96,278 (280)
Strong products of Kneser graphs [PDF]
Discrete Mathematics, 1994 For a (simple, undirected) graph \(G = (V(G), E(G))\), let \(\chi(G)\) and \(\omega(G)\) denote the chromatic number and the clique number, respectively. A subgraph \(H\) of \(G\) is a retract of \(G\) iff there is an edge-preserving map \(h : V(G) \to V(H)\) with \(h(x) = x\) for all \(x \in V(H)\).
Sandi Klavzar, Uros Milutinovic
openaire +2 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 +3 more sources
Strong chromatic index of products of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 The strong chromatic index of a graph is the minimum number of colours needed to colour the edges in such a way that each colour class is an induced matching.
Olivier Togni
doaj +5 more sources
Resolvability and Strong Resolvability in the Direct Product of Graphs [PDF]
Results in Mathematics, 2016 Given a connected graph $G$, a vertex $w\in V(G)$ distinguishes two different vertices $u,v$ of $G$ if the distances between $w$ and $u$ and between $w$ and $v$ are different. Moreover, $w$ strongly resolves the pair $u,v$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$.
Dorota Kuziak +2 more
exaly +4 more sources
On the geodetic and the hull numbers in strong product graphs
Computers and Mathematics With Applications, 2010 A set S of vertices of a connected graph G is convex, if for any pair of vertices u; v 2 S, every shortest path joining u and v is contained in S . The convex hull CH(S) of a set of vertices S is defined as the smallest convex set in G containing S. The set S is geodetic, if every vertex of G lies on some shortest path joining two vertices in S, and it
Carmen Hernando +2 more
exaly +4 more sources
The primitivity of the strong product of two directed graphs [PDF]
Discrete Mathematics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kwaśnik, Maria
openaire +3 more sources
The hull number of strong product graphs [PDF]
Discussiones Mathematicae Graph Theory, 2011 For a connected graph G with at least two vertices and S a subset of vertices, the convex hull $[S]_G$ is the smallest convex set containing S. The hull number h(G) is the minimum cardinality among the subsets S of V(G) with $[S]_G = V(G)$.
A. P. Santhakumaran +1 more
openaire +2 more sources
Connectivity of Strong Products of Graphs [PDF]
Graphs and Combinatorics, 2010 The strong product of graphs is one of the three commutative and associative graph products. Let \(S\) be the strong product of two given graphs. The author proves that every minimum separating set in \(S\) is either an \(I\)-set or an \(L\)-set in \(S\).
Ladinek, Irena Hrastnik, Spacapan, Simon
openaire +6 more sources
Zero-sum flow number of categorical and strong product of graphs [PDF]
Transactions on Combinatorics, 2020 A zero-sum flow is an assignment of nonzero integers to the edges such that the sum of the values of all edges incident with each vertex is zero, and we call it a zero-sum $k$-flow if the absolute values of edges are less than $k$. We define the zero-sum
Muhammad Aamer Rashid +4 more
doaj +1 more source
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