Results 61 to 70 of about 91 (88)

Sombor index of zero-divisor graphs of commutative rings

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2022
In this paper, we investigate the Sombor index of the zero-divisor graph of ℤn which is denoted by Γ(ℤn) for n ∈ {pα, pq, p2q, pqr} where p, q and r are distinct prime numbers. Moreover, we introduce an algorithm which calculates the Sombor index of Γ(ℤn)
Gürsoy Arif   +2 more
doaj   +1 more source

Complex of abstract cubes and median problem [PDF]

open access: yesComputer Science Journal of Moldova, 2011
In this paper a special complex $\mathcal{K}^{n}$ of abstract cubes [2, 3], which contains only $n$-dimensional cubes is examined. The border of this complex is an abstract $(n-1)$-dimensional sphere.
Sergiu Cataranciuc, Petru Soltan
doaj  

Optimizing compatible sets in wireless networks through integer programming

open access: yesEURO Journal on Computational Optimization, 2014
In wireless networks, the notion of compatible set refers to a set of radio links that can be simultaneously active with a tolerable interference. Finding a compatible set with maximum weighted revenue from the parallel transmissions is an important ...
Yuan Li   +3 more
doaj   +1 more source

Eccentricity of Networks with Structural Constraints

open access: yesDiscussiones Mathematicae Graph Theory, 2020
The eccentricity of a node v in a network is the maximum distance from v to any other node. In social networks, the reciprocal of eccentricity is used as a measure of the importance of a node within a network.
Krnc Matjaž   +3 more
doaj   +1 more source

Caterpillars Have Antimagic Orientations

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2018
An antimagic labeling of a directed graph D with m arcs is a bijection from the set of arcs of D to {1, …, m} such that all oriented vertex sums of vertices in D are pairwise distinct, where the oriented vertex sum of a vertex u is the sum of labels of ...
Lozano Antoni
doaj   +1 more source

Revisiting structure graphs: Applications to CBC-MAC and EMAC

open access: yesJournal of Mathematical Cryptology, 2016
In [2], Bellare, Pietrzak and Rogaway proved an O⁢(ℓ⁢q2/2n)${O(\ell q^{2}/2^{n})}$ bound for the PRF (pseudorandom function) security of the CBC-MAC based on an n-bit random permutation Π, provided ...
Jha Ashwin, Nandi Mridul
doaj   +1 more source

Inserting One Edge into a Simple Drawing is Hard. [PDF]

open access: yesDiscrete Comput Geom, 2023
Arroyo A   +5 more
europepmc   +1 more source

Completeness for the Complexity Class ∀∃R and Area-Universality. [PDF]

open access: yesDiscrete Comput Geom, 2023
Dobbins MG   +3 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy