Results 161 to 170 of about 26,105 (190)
Some of the next articles are maybe not open access.
Lexicographic products in metarouting
2007 IEEE International Conference on Network Protocols, 2007Routing protocols often keep track of multiple route metrics, where some metrics are more important than others. Route selection is then based on lexicographic comparison: the most important attribute of each route is considered first, and if this does not give enough information to decide which route is better, the next attribute is considered; and so
Alexander J. T. Gurney +1 more
openaire +1 more source
On the Pancyclicity of Lexicographic Products
Graphs and Combinatorics, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kaiser, Tomáš, Kriesell, Matthias
openaire +2 more sources
The weight of lexicographic products
Topology and its Applications, 2020Let \(\gamma\) be an ordinal \(\geq 2\) and \(X_\alpha\) be a GO-space for ...
Hirata, Yasushi, Kemoto, Nobuyuki
openaire +2 more sources
Cayley digraphs and lexicographic product
Frontiers of Mathematics in China, 2007Let \(X\) and \(Y\) be digraphs. By the lexicographic product \(X[Y]\), we mean the digraph whose vertex set \(V(X[Y])\) is \(V(X)\times V(Y)\) and whose arc set is \[ A(X[Y]) = \left\{((x,y),(x',y'))\mid (x,x')\in A(X), \text{ or }x=x' \text{ and } (y,y')\in A(Y)\right\}.
Peng, Xing, Wang, Dianjun
openaire +1 more source
Antimagicness of Lexicographic Product Graph G[Pn]
Acta Mathematicae Applicatae Sinica, English Series, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lu, Ying-yu, Dong, Guang-hua, Wang, Ning
openaire +2 more sources
Convex Sets in Lexicographic Products of Graphs
Graphs and Combinatorics, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anand, Bijo S. +3 more
openaire +1 more source
The security number of lexicographic products
Quaestiones Mathematicae, 2017A subset S of vertices of a graph G is a secure set if |N[X] ∩ S| ≥ |N[X]−S| holds for any subset X of S, where N[X] denotes the closed neighborhood of X. The minimum cardinality s(G) of a secure set in G is called the security number of G. We investigate the security number of lexicographic product graphs by defining a new concept of tightly-securable
Gologranc, Tanja +2 more
openaire +2 more sources
The reliability of lexicographic product digraphs
Applied Mathematics and Computation, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Qinghai, Hong, Yanmei
openaire +2 more sources
Path-connectivity of lexicographic product graphs
International Journal of Computer Mathematics, 2014Dirac showed that in a -connected graph there is a path through all the k vertices. The k-path-connectivity of a graph G, which is a generalization of Dirac's notion, was introduced by Hager in 1986. Denote by the lexicographic product of two graphs G and H. In this paper, we prove that for any two connected graphs G and H. Moreover, the
openaire +1 more source
Arbitrary-term-absent max-product fuzzy relation inequalities and its lexicographic minimal solution
Information Sciences, 2021Jianjun Qiu, Guanrong Li
exaly