Results 251 to 260 of about 4,787 (279)

Attack and defense networks in a student social system. [PDF]

PLoS One
Morales-Huitrón A, Hernández-Hernández AM, Canto-Lugo E, Huerta-Quintanilla R.   +3 more
europepmc   +1 more source

Contextual stressors and multidimensional mental health among university students during the COVID-19 period: a construct-level network analysis. [PDF]

BMC Psychol
Cui Z, Wu S, Ma H, Zhang Y, Lin X, Hou X, Ren Y, Feng Y, Cao Y.   +8 more
europepmc   +1 more source

Life skills evaluation in a kindergarten special education classroom. [PDF]

J Appl Behav Anal
Torelli JN, Snyder SK, Griffin ML, Hellemn MP, Cagliani RR, Morgan GA.   +5 more
europepmc   +1 more source

Clusterin protects against HFpEF by inhibiting UCHL1-mediated NLRP3 deubiquitylation and inflammasome activation. [PDF]

Front Pharmacol
Yu J, Kang X, Chang R, Zhang C, Yang S, Chen L, Wang X, Hu B, Wang Z, Gong L, Liu L.   +10 more
europepmc   +1 more source

Associations of perceived teacher-student relationship and friendship quality with adolescents' interest in physical education: a latent profile analysis. [PDF]

Front Sports Act Living
Chen X, Huang W, Hu C.
europepmc   +1 more source

Degrees of Vertices in a Friendship Graph [PDF]

Canadian Mathematical Bulletin, 1975
AbstractA friendship graph is a graph in which every two distinct vertices have exactly one common adjacent vertex (called a neighbour). Finite friendship graphs have been characterized by Erdós, Rényi and Sós [2]: Each finite friendship graph Fn which consists of n edge disjoint triangles such that all n>1 triangles have one vertex in common (F1 is
Anton Kotzig
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Symmetric graph designs on friendship graphs

Journal of Combinatorial Designs, 2000
A symmetric graph design with parameters \((n,G,\lambda; F)\) is a set \(\{G_1,G_2,\dots, G_n\}\) of spanning subgraphs of \(K_n\) such that (a) \(G_i\simeq G\) for \(i= 1,2,\dots, n\); (b) any edge of \(K_n\) is contained in exactly \(\lambda\) subgraphs \(G_i\); and (c) \(G_i\cap G_j\simeq F\) for \(i,j= 1,2,\dots, n\), \(i\neq j\).
Fronček, Dalibor, Rosa, Alexander
exaly   +3 more sources

A study of a time-graph friendship model

2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, 2011
Modeling friendship is a challenging task in social networking given the opportunistic behavior of human relationships that is hard to model. In this paper a simple two-state markov chain model is introduced attempting to give further insight on friendship and particularly how relations evolve as time passes, given that the corresponding graph is a ...
Konstantinos Oikonomou
exaly   +2 more sources

Irregular colorings of friendship graph families

Journal of Discrete Mathematical Sciences and Cryptography, 2020
In this paper, we acquired the irregular chromatic number for the following graphs: M( fn), T( fn), C( fn), L( fn), M(DFn), T(DFn), L(DFn), C(DFn), M(SFn), T(SFn), L(SFn), C(SFn).
A Rohini, M Venkatachalam
exaly   +2 more sources

Friendship Two-Graphs

Graphs and Combinatorics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Endre Boros, Vladimir Gurvich, Igor E. Zverovich   +2 more
openaire   +1 more source