Results 71 to 80 of about 855 (105)
Improved bounds for the crossing numbers of K_m,n and K_n
, 2004 It has been long--conjectured that the crossing number cr(K_m,n) of the complete bipartite graph K_m,n equals the Zarankiewicz Number Z(m,n):= floor((m-1)/2) floor(m/2) floor((n-1)/2) floor(n/2). Another long--standing conjecture states that the crossing
de Klerk, E. +4 more
core +2 more sources
Shrub-depth: Capturing Height of Dense Graphs [PDF]
Logical Methods in Computer Science, 2019 The recent increase of interest in the graph invariant called tree-depth and in its applications in algorithms and logic on graphs led to a natural question: is there an analogously useful "depth" notion also for dense graphs (say; one which is stable ...
Robert Ganian +4 more
doaj +1 more source
Finite-dimensional Zinbiel algebras and combinatorial structures
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2022 In this paper, we study the link between finite-dimensional Zinbiel algebras and combinatorial structures or (pseudo)digraphs determining which configurations are associated with those algebras.
Ceballos Manuel +2 more
doaj +1 more source
Sombor index of zero-divisor graphs of commutative rings
Analele 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]
Computer 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
EURO 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
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
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
The rectilinear local crossing number of $K_n$
, 2017 We determine ${\bar{\rm{lcr}}}(K_n)$, the rectilinear local crossing number of the complete graph $K_n$ for every $n$. More precisely, for every $n \notin \{8, 14 \}, $ \[ {\bar{\rm{lcr}}}(K_n)=\left\lceil \frac{1}{2} \left( n-3-\left\lceil \frac{n-3}{3}
Fernández-Merchant, Silvia +1 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