Results 51 to 60 of about 728,663 (278)

A C3 Magic Decomposition on Friendship Graph with Odd Order

Jurnal Ilmu Dasar, 2022
Let G = (V,E) is graph with a non-empty set V containing vertices and a set of edges E. Also note that if H = {H_i⊆G_i = 1,2,3,...,n} is a collection of subgraphs from G with H_i≅Hj,i ≠ j.
Indah Chairun Nisa, Sigit Pancahayani, Annisa Rahmita Soemarsono   +2 more
doaj   +1 more source

Analyzing the Facebook Friendship Graph

CoRR, 2010
6 pages, 1 figure; MIFI '10: Proceedings of the 1st International Workshop on Mining the Future ...
CATANESE Salvatore, DE MEO, Pasquale, FERRARA, EMILIO, FIUMARA, Giacomo   +3 more
openaire   +5 more sources

Temporal Exponential Random Graph Models with btergm: Estimation and Bootstrap Confidence Intervals

Journal of Statistical Software, 2018
The xergm package is an implementation of extensions to the exponential random graph model (ERGM). It acts as a meta-package for multiple constituent packages.
Philip Leifeld, Skyler J. Cranmer, Bruce A. Desmarais   +2 more
doaj   +1 more source

MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis

FEBS Open Bio, EarlyView.
MagmaFlow is a free, no‐code platform for gene expression analysis. It generates interactive volcano plots, links genes to literature, pathways, and diseases, prioritizes candidates using millions of publications, identifies affected biological processes, builds network diagrams, and exports publication‐ready figures and reports for macOS and Windows ...
Carlos E. Buss, Ao Li, Eduardo H. Gilglioni, Mayank Bansal, Sumeet Pal Singh, Latifa Bakiri, Alessandra K. Cardozo, Esteban N. Gurzov   +7 more
wiley   +1 more source

On irregularity strength of disjoint union of friendship graphs

Electronic Journal of Graph Theory and Applications, 2013
We investigate the vertex total and edge total modication of the well-known irregularity strength of graphs. We have determined the exact values of the total vertex irregularity strength and the total edge irregularity strength of a disjoint union of friendship graphs.
Ali Ahmad 0003, Martin Baca, Muhammad Numan   +2 more
openaire   +4 more sources

Comparative assessment of crystallographic and cryo‐EM models in the Protein Data Bank

FEBS Open Bio, EarlyView.
Raw data obtained by X‐ray crystallography or cryo‐EM result in experimental maps, ultimately fitted by atomic models. Although the physical principles are different, the final results can be viewed, compared, and evaluated in the same way. With cryogenic electron microscopy (cryo‐EM) on track to surpass X‐ray crystallography as the preferred method ...
Alexander Wlodawer, Pawel Rubach, Zbigniew Dauter, Wojciech Dec, Dariusz Brzezinski, Marta Kulik, Wladek Minor, Mariusz Jaskolski   +7 more
wiley   +1 more source

Plasma EV Proteomics Identifies ECM Remodeling and Inflammatory Proteins LUM and C7 as Candidate Biomarkers in FSHD

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Facioscapulohumeral muscular dystrophy (FSHD) is one of the most debilitating and common muscular dystrophies. Despite its severity, no approved therapy exists for FSHD patients. However, several therapeutic candidates are currently under development, and some have recently entered clinical trials, marking the need for reliable ...
Mustafa Bilal Bayazit, Chiranth K. Nagaraj, Jackson S. Newell, Kim Truc Nguyen, Xilal Y. Rima, Jacob Doon‐Ralls, Eduardo Reátegui, Jeffrey M. Statland, Rabi Tawil, Kevin M. Flanigan, Scott Q. Harper, Nizar Y. Saad   +11 more
wiley   +1 more source

Investigation of Complement Activation and Cytokine Signatures in AQP4+ NMOSD, MOGAD, and MS

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Aquaporin‐4‐IgG seropositive neuromyelitis optica spectrum disorder (AQP4+ NMOSD), myelin oligodendrocyte glycoprotein antibody‐associated disease (MOGAD), and multiple sclerosis (MS) are pathophysiologically distinct neuroinflammatory disorders. Complement activation is a major mechanism of injury in AQP4+ NMOSD, whereas its role in
Angeliki G. Filippatou, Susana Dominguez‐Penuela, David Acero‐Garces, Georgios Gakis, Matthew D. Smith, Yasmin Resto, Maria Reyes‐Mantilla, Haiwen Chen, Isabella Hernandez, Yana Said, Andrea Salazar‐Camelo, Christina Huynh, Alessia Tassoni, Ted Yednock, Rick Artis, Yaisa Andrews‐Zwilling, Scott D. Newsome, Shiv Saidha, Pavan Bhargava, Ellen M. Mowry, Kathryn C. Fitzgerald, Peter A. Calabresi, Carlos A. Pardo, Elias S. Sotirchos   +23 more
wiley   +1 more source

Computation of the eigenvalues of complete signed graphs

Electronic Journal of Graph Theory and Applications
A signed graph Σ is the ordered pair (G,σ), where G=(V,E) is a finite simple graph, called the underlying graph, and σ: E(G) → {+1, -1} is a sign function or a signature of Σ. Let (K_n,σ) be a complete signed graph with n vertices. In this paper, we give
Shariefuddin Pirzada, Mir Riyaz Ul Rashid, Amir Rehman, Edy Tri Baskoro   +3 more
doaj   +1 more source

Interlace polynomials of 4n-snowflake graphs

Electronic Journal of Graph Theory and Applications, 2023
In this paper, we study the interlace polynomial of a special graph with n vertices, called 4n-snowflake graph. It is similar as the friendship graph Fn of n vertices, which is made of n 3-cycles sharing one center vertex.
Jyoti Champanerkar, Aihua Li
doaj   +1 more source