Results 31 to 40 of about 1,124,405 (260)
New Concepts of Picture Fuzzy Graphs with Application
Mathematics, 2019 The picture fuzzy set is an efficient mathematical model to deal with uncertain real life problems, in which a intuitionistic fuzzy set may fail to reveal satisfactory results.
Cen Zuo, Anita Pal, Arindam Dey
doaj +1 more source
Strong chromatic index of products of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Graphs and ...
Olivier Togni
doaj +1 more source
Products of Strong Świa̧tkowski Functions [PDF]
Journal of Applied Analysis, 2006 A function \(f\) is said to be a strong Świątkowski function if whenever \(\alpha , \beta \in I\) and \( y \in I(f(\alpha),f(\beta))\), there is an \(x_0 \in I(\alpha,\beta) \cap C(f)\) such that \(f(x_0) = y\) where \(I\) is a nondegenerate interval, \(I(a,b) = (a,b)\) if \(a < b\) and \((b,a)\) otherwise and \(C(f)\) denotes the set of all points of ...
openaire +2 more sources
The Italian Domination Numbers of Some Products of Directed Cycles
Mathematics, 2020 An Italian dominating function on a digraph D with vertex set V(D) is defined as a function f:V(D)→{0,1,2} such that every vertex v∈V(D) with f(v)=0 has at least two in-neighbors assigned 1 under f or one in-neighbor w with f(w)=2.
Kijung Kim
doaj +1 more source
Strong products of Kneser graphs
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 +1 more source
European Journal of Combinatorics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 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
European Journal of CombinatoricsRecent results show that several important graph classes can be embedded as subgraphs of strong products of simpler graphs classes (paths, small cliques, or graphs of bounded treewidth). This paper develops general techniques to bound the chromatic number (and its popular variants, such as fractional, clustered, or defective chromatic number) of the ...
Esperet, Louis, Wood, David
openaire +4 more sources
Retracts of strong products of graphs
Discrete Mathematics, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wilfried Imrich, Sandi Klavzar
openaire +1 more source
Cosmological particle production at strong coupling [PDF]
Journal of High Energy Physics, 2015 We study the dynamics of a strongly-coupled quantum field theory in a cosmological spacetime using the holographic AdS/CFT correspondence. Specifically we consider a confining gauge theory in an expanding FRW universe and track the evolution of the stress-energy tensor during a period of expansion, varying the initial temperature as well as the rate ...
Rangamani, Mukund +2 more
openaire +5 more sources