Results 31 to 40 of about 745,346 (269)
Parameterized Maximum and Average Degree Approximation in Topic-Based Publish-Subscribe Overlay Network Design [PDF]
Computer Networks, 2010 Publish/subscribe communication systems where nodes subscribe to many different topics of interest are becoming increasingly more common. Designing overlay networks that connect the nodes subscribed to each distinct topic is hence a fundamental problem in these systems.
Melih Onus, Andréa W. Richa
openalex +4 more sources
Coloring the square of graphs whose maximum average degree is less than 4
Discrete Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seog‐Jin Kim, Boram Park
openalex +2 more sources
Proximity, remoteness and maximum degree in graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 The average distance of a vertex $v$ of a connected graph $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The proximity $\pi(G)$ and the remoteness $\rho(G)$ of $G$ are the minimum and the maximum of the average ...
Peter Dankelmann +2 more
doaj +1 more source
Electronic Notes in Discrete Mathematics, 2007 Abstract In that paper we talk about triangle-free simple graphs with given maximum average degree less than 22 / 9. We give an upper bound for the circular chromatic number of such graphs which is at most 11 / 4. We give two other results whose proofs are omitted. We use a discharging method with forbidden configurations.
André Raspaud, Nicolas Roussel
openalex +2 more sources
Wiener index in graphs given girth, minimum, and maximum degrees
Theory and Applications of Graphs, 2023 Let $G$ be a connected graph of order $n$. The Wiener index $W(G)$ of $G$ is the sum of the distances between all unordered pairs of vertices of $G$.
Fadekemi J. Osaye +3 more
doaj +1 more source
Improper choosability of graphs and maximum average degree [PDF]
Journal of Graph Theory, 2006 AbstractImproper choosability of planar graphs has been widely studied. In particular, Škrekovski investigated the smallest integer gk such that every planar graph of girth at least gk is k‐improper 2‐choosable. He proved [9] that 6 ≤ g1 ≤ 9; 5 ≤ g2 ≤ 7; 5 ≤ g3 ≤ 6; and ∀ k ≥ 4, gk = 5.
Frédéric Havet +1 more
openaire +1 more source
An oriented coloring of graphs with maximum average degree less that 10/3
, 2007 An oriented k-coloring of an oriented graph G is a homomorphism from G to an oriented graph H of order k. We prove that every oriented graph with maximum average degree strictly less than 10/3 has an oriented chromatic number at most 16. This improves the previous known bound of 19 due to Borodin et al. [Borodin, O. V. and Kostochka, A. V. and Nesetril,
Alexandre Pinlou
openalex +3 more sources
Two-distance vertex-distinguishing index of sparse graphs
Open Mathematics, 2023 The two-distance vertex-distinguishing index χd2′(G){\chi }_{d2}^{^{\prime} }\left(G) of graph GG is defined as the smallest integer kk, for which the edges of GG can be properly colored using kk colors.
He Zhengyue, Liang Li, Gao Wei
doaj +1 more source
Spatial statistics of superposition of two uncorrelated speckle patterns with polarization diversity
Results in Optics, 2021 A detailed theoretical and experimental study on the effect of the superposition of uncorrelated speckle patterns with polarization diversity on the spatial statistics of the superposed speckle pattern is presented.
Abhijit Roy
doaj +1 more source
An objective pronator drift test application (iPronator) using handheld device. [PDF]
PLoS ONE, 2012 BACKGROUND: The pronator drift test is widely used to detect mild arm weakness. We developed an application that runs on a handheld device to objectify the pronator drift test and investigated its feasibility in stroke patients.
Soojeong Shin +5 more
doaj +1 more source