Results 31 to 40 of about 4,787 (279)
The dual role of friendship and antipathy relations in the marginalization of overweight children in their peer networks: The TRAILS Study. [PDF]
Weight-based stigma compromises the social networks of overweight children. To date, research on the position of overweight children in their peer network has focused only on friendship relations, and not on negative relationship dimensions.
Kayla de la Haye +4 more
doaj +1 more source
Energy of Certain Classes of Graphs Determined by Their Laplacian Degree Product Adjacency Spectrum
In this study, we investigate the Laplacian degree product spectrum and corresponding energy of four families of graphs, namely, complete graphs, complete bipartite graphs, friendship graphs, and corona products of 3 and 4 cycles with a null graph.
Asim Khurshid +3 more
doaj +1 more source
Hasil Kali Matriks (Mod 2) pada Graf Roda, Graf Pertemanan dan Graf Bunga
ABSTRAK Pada artikel ini dibahas sifat-sifat hasil kali matriks (mod 2) terkait graf roda, graf pertemanan, dan graf bunga yang grafikal. Beberapa hasil yang diperoleh, A(Wn)A(Wn)(Mod 2) dan A(Wn)A(Sn)(Mod 2) grafikal apabila n=2k+1 dengan Sn merupakan ...
Fransiskus Fran +2 more
doaj +1 more source
On the domination polynomials of friendship graphs
Let G be a simple graph of order n. The domination polynomial of G is the polynomial D(G,x)= n?i=0 d(G,i)xi, where d(G,i) is the number of dominating sets of G of size i. Let n be any positive integer and Fn be the Friendship graph with 2n + 1 vertices and 3n edges, formed by the join of K1 with nK2.
Alikhani, Saeid +2 more
openaire +3 more sources
Friendship establishment was analyzed using constructs from social cognitive theory (self-efficacy and personality traits) and social network theory (reciprocity and triad closure).
Dongdong Yan, Xi Yang, Huanzhe Zhang
doaj +1 more source
The Detection of Anomalous Users in Location-Based Social Networks by Using Graph Rules [PDF]
An analysis of social networks is necessary to detect anomalous users, due to the popularity of these networks. This paper aims to detect anomalous users in location based social networks. For this purpose, an ego graph is computed for each user, and the
Fatemeh Edalati, Morteza Romoozi
doaj +1 more source
A Variant of The Theorem of Friendship
With the help of graph theory and linear algebra can give a demonstration a variant of the theorem of ...
Edison Montoro Alegre +5 more
doaj +1 more source
The spectral characterization of the connected multicone graphs
A multicone graph is defined to be the join of a clique and a regular graph. Let , and be natural numbers, and let and denote a complete graph and a complete bipartite graph, respectively.
Ali Zeydi Abdian +2 more
doaj +1 more source
The Local Antimagic Chromatic Numbers of Some Join Graphs
Let G=(V(G),E(G)) be a connected graph with n vertices and m edges. A bijection f:E(G)→{1,2,⋯,m} is an edge labeling of G. For any vertex x of G, we define ω(x)=∑e∈E(x)f(e) as the vertex label or weight of x, where E(x) is the set of edges incident to x,
Xue Yang +3 more
doaj +1 more source
Infinite generalized friendship graphs
Let \(\tau\geq 2\) and \(\lambda\geq 1\) be integers, and let c be an infinite cardinal number. It is shown that \(\tau \leq \lambda +1\) is necessary and sufficient for the existence of (simple) infinite graphs of order c such that every subset of \(\tau\) vertices has exactly \(\lambda\) common neighbors.
Charles Delorme, Gena Hahn
openaire +2 more sources

