Results 171 to 180 of about 1,343 (197)
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
The metric dimension of the lexicographic product of graphs
Discrete Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A N M Salman +2 more
exaly +3 more sources
Rainbow domination in the lexicographic product of graphs
Discrete Applied Mathematics, 2013 14 pages, 2 ...
Tadeja Kraner Šumenjak +2 more
exaly +4 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
Coupon coloring of lexicographic product of graphs
The Art of Discrete and Applied Mathematics, 2022Summary: A \(k\)-coupon coloring of a graph \(G\) without isolated vertices is an assignment of colors from \([k]=\{1,2,\dots,k\}\) to the vertices of \(G\) such that the neighborhood of every vertex of \(G\) contains vertices of all colors from \([k]\).
Reji Thankachan, Pavithra Rajamani
openaire +2 more sources
Total Roman domination in the lexicographic product of graphs [PDF]
Discrete Applied Mathematics, 2019 A total Roman dominating function of a graph $G=(V,E)$ is a function $f: V(G)\to \{0,1,2\}$ such that for every vertex $v$ with $f(v)=0$ there exists a vertex $u$ adjacent to $v$ with $f(u)=2$, and such that the subgraph induced by the set of vertices ...
Dorota Kuziak
exaly +3 more sources
The reliability of lexicographic product digraphs
Applied Mathematics and Computation, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qinghai Liu, Yanmei Hong
openaire +2 more sources
Convex Sets in Lexicographic Products of Graphs
Graphs and Combinatorics, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bijo S. Anand +3 more
openaire +1 more source
Lexicographic Products and a Conjecture of Hahn and Jackson
SIAM Journal on Discrete Mathematics, 2009Summary: The Gallai-Milgram theorem asserts that the vertex set of any digraph with stability number \(k\) can be partitioned into \(k\) directed paths. Hahn and Jackson conjectured that, for any positive integer \(k\), there exists a digraph with stability number \(k\) such that the subdigraph obtained by deleting any \(k-1\) directed paths still has ...
J. Adrian Bondy +2 more
openaire +2 more sources
The metric dimension of the lexicographic product of graphs
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohsen Jannesari, Behnaz Omoomi
exaly +2 more sources