Results 91 to 100 of about 4,787 (279)

Disparity-persistence and the multistep friendship paradox [PDF]

, 2023
In this thesis, we consider the friendship paradox in the context of random walks and paths. Among our results, we give an equality connecting long-range degree correlation, degree variability, and the degree-wise effect of additional steps for a random ...
Zhang, Chi
core  

Edge even graceful labelling of new families of graphs

Journal of Taibah University for Science, 2019
Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges called an edge even graceful labelling. A graph G is called edge even graceful if there is a bijection $f: E(G) \rightarrow \{2, 4,\ldots , 2q\} $ such that ...
S. N. Daoud, Ahmed N. Elsawy
doaj   +1 more source

Portable Molecularly Imprinted Polymer Sensor for Rapid Swab‐Based Detection of Norovirus

Advanced Healthcare Materials, EarlyView.
This work reports a rapid, portable smartphone‐based sensor capable of detecting four norovirus genotypes from swab samples within 15 min. Sensor selectivity was validated through evaluation against four common live viruses. The swab‐based sampling process enabled simple sample preparation combined with the compact detection system, supporting use of ...
Amy Dann, Pankaj Singla, Minji Kim, Sloane Stoufer, Clare Thomas, Robert D. Crapnell, Craig E. Banks, Jake McClements, Shayan Seyedin, Mark Geoghegan, Samuel T. Jones, Christopher F. Blanford, Matthew D. Moore, Marloes Peeters   +13 more
wiley   +1 more source

The Friendship Problem on Graphs [PDF]

, 2016
In this paper we provide a purely combinatorial proof of the Friendship Theorem, which has been first proven by P. Erdős et al. by using also algebraic methods.
Mertzios, George. B., Unger, W., Unger, Walter, Mertzios, G.B.   +3 more
core   +1 more source

Double Domination Number of Some Families of Graph [PDF]

, 2020
In a graph G = (V, E) each vertex is said to dominate every vertex in its closed neighborhood. In a graph G, if S is a subset of V then S is a double dominating set of G if every vertex in V is dominated by at least two vertices in S.
Manjula. C. Gudgeri, Varsha
core   +1 more source

Unordered Love in infinite directed graphs

International Journal of Mathematics and Mathematical Sciences, 1992
A digraph D=(V,A) has the Unordered Love Property (ULP) if any two different vertices have a unique common outneighbor. If both (V,A) and (V,A−1) have the ULP, we say that D has the SDULP.
Peter D. Johnson
doaj   +1 more source

Artificial Intelligence‐Assisted Workflow for Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling

Advanced Materials, EarlyView.
AI‐Assisted Workflow for (Scanning) Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling. Abstract (Scanning) transmission electron microscopy ((S)TEM) has significantly advanced materials science but faces challenges in correlating precise atomic structure information with the functional properties of ...
Marc Botifoll, Ivan Pinto‐Huguet, Enzo Rotunno, Thomas Galvani, Catalina Coll, Payam Habibzadeh Kavkani, Maria Chiara Spadaro, Yann‐Michel Niquet, Martin Børstad Eriksen, Sara Martí‐Sánchez, Georgios Katsaros, Giordano Scappucci, Peter Krogstrup, Giovanni Isella, Andreu Cabot, Gonzalo Merino, Pablo Ordejón, Stephan Roche, Vincenzo Grillo, Jordi Arbiol   +19 more
wiley   +1 more source

Fairwalk: Towards Fair Graph Embedding [PDF]

, 2019
Graph embeddings have gained huge popularity in the recent years as a powerful tool to analyze social networks. However, no prior works have studied potential bias issues inherent within graph embedding.
Michael Backes, Zhang, Yang, Rahman, Tahleen, Yang Zhang, Backes, Michael, Surma, Bartlomiej, Bartlomiej Surma, Tahleen Rahman   +7 more
core   +3 more sources

Socially Grounded IoT Protocol for Reliable Computer Vision in Industrial Applications

Future Internet
The Social Internet of Things (SIoT) enables collaborative service provisioning among interconnected devices by leveraging socially inspired trust relationships.
Gokulnath Chidambaram, Shreyanka Subbarayappa, Sai Baba Magapu   +2 more
doaj   +1 more source

The eccentric-distance sum of some graphs

Electronic Journal of Graph Theory and Applications, 2017
Let $G = (V,E)$ be a simple connected graph. Theeccentric-distance sum of $G$ is defined as$\xi^{ds}(G) =\ds\sum_{\{u,v\}\subseteq V(G)} [e(u)+e(v)] d(u,v)$, where $e(u)$ %\dsis the eccentricity of the vertex $u$ in $G$ and $d(u,v)$ is thedistance ...
Padmapriya P, Veena Mathad
doaj   +1 more source