Eccentricity of Networks with Structural Constraints
Discussiones 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
Algorithmic releases on spanning trees of Jahangir graphs
, 2017 In this paper algebraic and combinatorial properties and a computation of the number of the spanning trees are developed for a Jahangir graph.Comment: 17 pages, 4 ...
Imbesi, Maurizio +2 more
core
ORTHOGONAL TRACE-SUM MAXIMIZATION: TIGHTNESS OF THE SEMIDEFINITE RELAXATION AND GUARANTEE OF LOCALLY OPTIMAL SOLUTIONS. [PDF]
SIAM J Optim, 2022 Won JH, Zhang T, Zhou H.
europepmc +1 more source
Measuring Generalized Preferential Attachment in Dynamic Social Networks
, 2005 The mechanism of preferential attachment underpins most recent social network formation models. Yet few authors attempt to check or quantify assumptions on this mechanism.
Roth, Camille
core +4 more sources
Quartet consistency count method for reconstructing phylogenetic trees
, 2006 Among the distance based algorithms in phylogenetic tree reconstruction, the neighbor-joining algorithm has been a widely used and effective method. We propose a new algorithm which counts the number of consistent quartets for cherry picking with tie ...
Cho, Jin-Hwan +2 more
core
Caterpillars Have Antimagic Orientations
Analele 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
Modeling calcium dynamics in neurons with endoplasmic reticulum: existence, uniqueness and an implicit-explicit finite element scheme. [PDF]
Commun Nonlinear Sci Numer Simul, 2022 Guan Q, Queisser G.
europepmc +1 more source
Revisiting structure graphs: Applications to CBC-MAC and EMAC
Journal 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]
Discrete Comput Geom, 2023 Arroyo A +5 more
europepmc +1 more source
Completeness for the Complexity Class ∀∃R and Area-Universality. [PDF]
Discrete Comput Geom, 2023 Dobbins MG +3 more
europepmc +1 more source