Results 181 to 190 of about 5,793,190 (230)

A risk-averse sustainable perishable food supply chain considering production and delivery times with real-world application. [PDF]

PLoS One
Shakuri M, Barzinpour F.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Path 3-(edge-)connectivity of lexicographic product graphs

Discrete Applied Mathematics, 2020
Dirac showed that in a ( k − 1 ) -connected graph there is a path through all the k vertices. The path k -connectivity π k ( G ) of a graph G , which is a generalization of Dirac’s notion, was introduced by Hager in 1986. As a natural counterpart of path
Tianlong Ma, Jinling Wang, Mingzu Zhang   +2 more
exaly   +2 more sources

On the Roman domination in the lexicographic product of graphs

Discrete Applied Mathematics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tadeja Kraner Sumenjak, Aleksandra Tepeh   +1 more
exaly   +5 more sources

Double total domination in the generalized lexicographic product of graphs

Quaestiones Mathematicae. Journal of the South African Mathematical Society, 2023
Let G be a graph of minimum degree at least two. A set D ⊆ V(G) is said to be a double total dominating set of G if |N (v) ∩ D| ≥ 2 for every vertex v ∈ V(G).
A. Cabrera-Martínez, Ismael Ríos Villamar, J. M. Rueda-Vázquez, J. M. Sigarreta Almira   +3 more
semanticscholar   +1 more source

Weakly connected 2-domination in the lexicographic product of graphs

International Journal of Mathematical Analysis, 2022
Let G = ( V ( G ) , E ( G )) be a connected graph. A weakly connected 2-dominating set of G is a set D of vertices of G such that every vertex in V ( G ) \ D has at least two neighbors in D and the subgraph (cid:104) D (cid:105) w weakly induced by D is ...
Mae P. Militante, R. Eballe
semanticscholar   +1 more source

Pseudo MV-algebras and lexicographic product [PDF]

Fuzzy Sets and Systems, 2016
arXiv admin note: text overlap with arXiv:1304 ...
Anatolij Dvurečenskij
exaly   +3 more sources

On the Pancyclicity of Lexicographic Products

Graphs and Combinatorics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tomás Kaiser, Matthias Kriesell
openaire   +2 more sources

Lexicographic products in metarouting

2007 IEEE International Conference on Network Protocols, 2007
Routing 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, Timothy G. Griffin   +1 more
openaire   +1 more source

A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs

Czechoslovak Mathematical Journal, 2022
for a connected graph G = ( V, E ) and a set S ⊆ V ( G ) with at least two vertices, an S -Steiner tree is a subgraph T = ( V ′, E ′) of G that is a tree with S ⊆ V ′.
Y. Mao, Christopher Melekian, E. Cheng
semanticscholar   +1 more source

Rainbow domination in the lexicographic product of graphs

Discrete Applied Mathematics, 2013
14 pages, 2 ...
Tadeja Kraner Sumenjak, Douglas F Rall, Aleksandra Tepeh   +2 more
exaly   +4 more sources