Results 161 to 170 of about 1,343 (197)

(Inner-Product) Functional Encryption with Updatable Ciphertexts. [PDF]

open access: yesJ Cryptol
Cini V   +4 more
europepmc   +1 more source

On the Roman domination in the lexicographic product of graphs [PDF]

open access: yesDiscrete Applied Mathematics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aleksandra Tepeh
exaly   +6 more sources

The geodetic number of the lexicographic product of graphs [PDF]

open access: yesDiscrete Mathematics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boštjan Brešar, Aleksandra Tepeh
exaly   +5 more sources

Some results on the lexicographic product of vertex-transitive graphs [PDF]

open access: yesApplied Mathematics Letters, 2011
Many large graphs can be constructed from existing smaller graphs by using graph operations, for example, the Cartesian product and the lexicographic product.
Haixing Zhao, Lin Xu
exaly   +2 more sources

Double domination in lexicographic product graphs [PDF]

open access: yesDiscrete Applied Mathematics, 2020
[EN] In a graph G, a vertex dominates itself and its neighbours. A subset S subset of V(G) is said to be a double dominating set of G if S dominates every vertex of G at least twice.
Suitberto Cabrera   +1 more
exaly   +3 more sources

Pseudo MV-algebras and lexicographic product [PDF]

open access: yesFuzzy Sets and Systems, 2016
arXiv admin note: text overlap with arXiv:1304 ...
Anatolij Dvurečenskij
exaly   +3 more sources
Some of the next articles are maybe not open access.

Related searches:

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

Home - About - Disclaimer - Privacy