Results 181 to 190 of about 8,549 (260)

Secure mobile agents for efficient medical information retrieval: A verifiable variable threshold secret sharing approach. [PDF]

PLoS One
Kumar P, Rawat SS, Banerjee K, Salau AO, Kumar G, Singhal N.   +5 more
europepmc   +1 more source

Sparse Graphs With Local Covering Conditions on Edges

Journal of Graph Theory, EarlyView.
ABSTRACT In 1988, Erdős suggested the question of minimizing the number of edges in a connected n $n$‐vertex graph where every edge is contained in a triangle. Shortly after, Catlin, Grossman, Hobbs, and Lai resolved this in a stronger form. In this paper, we study a natural generalization of the question of Erdős in which we replace “triangle” with ...
Debsoumya Chakraborti, Amirali Madani, Anil Maheshwari, Babak Miraftab   +3 more
wiley   +1 more source

A new method for a priori practical identifiability. [PDF]

PLoS One
Thompson P, Andersson BJ, Sundqvist N, Cedersund G.   +3 more
europepmc   +1 more source

Path Degeneracy and Applications

Journal of Graph Theory, EarlyView.
ABSTRACT In this work, we relate girth and path‐degeneracy in classes with sub‐exponential expansion, with explicit bounds for classes with polynomial expansion and proper minor‐closed classes that are tight up to a constant factor (and tight up to second order terms if a classical conjecture on existence of g $g$‐cages is verified). As an application,
Yuquan Lin, Patrice Ossona de Mendez
wiley   +1 more source

Three-torsion subgroups and wild conductor exponents of plane quartics. [PDF]

Res Number Theory
Lupoian E, Rawson J.
europepmc   +1 more source

On Sparsity Conditions Guaranteeing a Fractional Coloring

Journal of Graph Theory, EarlyView.
ABSTRACT A graph has an ( a : b ) $(a:b)$ ‐coloring if there exists an assignment from the vertices to subsets of { 1 , … , a } $\{1,\ldots ,a\}$ with size b $b$ such that adjacent vertices are assigned disjoint subsets. Odd girth at least 2 k + 1 $2k+1$ is a necessary condition for a graph to have a ( 2 k + 1 : k ) $(2k+1:k)$‐coloring.
Ilkyoo Choi
wiley   +1 more source

On Double Cyclic Codes over Finite Chain Rings for DNA Computing. [PDF]

Entropy (Basel)
Ali S, Alali AS, Azeem M, Khan AA, Wong KB.   +4 more
europepmc   +1 more source

Saturated Partial Embeddings of Planar Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph G $G$, we say that a plane subgraph H ⊆ G $H\subseteq G$ is a plane‐saturated subgraph if adding any edge (possibly with new vertices) to H $H$ would either violate planarity or make the resulting graph no longer a subgraph of
Alexander Clifton, Nika Salia
wiley   +1 more source

On the real zeroes of half-integral weight Hecke cusp forms. [PDF]

Math Ann
Jääsaari J.
europepmc   +1 more source

Development and External Validation of a Postoperative Risk Score for Venous Thromboembolism in Epithelial Ovarian Cancer

The Kaohsiung Journal of Medical Sciences, EarlyView.
ABSTRACT Venous thromboembolism (VTE), including deep vein thrombosis and pulmonary embolism, is a major complication in women with epithelial ovarian cancer (EOC). We aimed to develop and externally validate an early postoperative risk score to identify EOC patients at increased risk of VTE after debulking surgery.
Qiu‐Lin Cui, Yu‐Shi He, Xuan‐Hui Wang, Cheng Li, Gang Wang, Ming Chen, Shu‐Min Chen   +6 more
wiley   +1 more source