Results 31 to 40 of about 2,715 (247)
On The Locating-Chromatic Numbers of Subdivisions of Friendship Graph
Journal of the Indonesian Mathematical Society, 2020 Let c be a k-coloring of a connected graph G and let pi={C1,C2,...,Ck} be the partition of V(G) induced by c. For every vertex v of G, let c_pi(v) be the coordinate of v relative to pi, that is c_pi(v)=(d(v,C1 ),d(v,C2 ),...,d(v,Ck )), where d(v,Ci )=min{d(v,x)|x in Ci }.
Salindeho, Brilly Maxel +2 more
openaire +2 more sources
The spectral characterization of the connected multicone graphs
AKCE International Journal of Graphs and Combinatorics, 2020 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
Infinite friendship graphs with infinite parameters
Journal of Combinatorial Theory, Series B, 1991 We study infinite graphs in which every set of \(\kappa\) vertices has exactly \(\lambda\) common neighbours. We prove that there exist \(2^{\sigma}\) such graphs of each infinite order \(\sigma\) if \(\kappa\) is finite and that for \(\kappa\) infinite there are \(2^{\lambda}\) of them of order \(\lambda\) and none of cardinality greater than ...
Gena Hahn +2 more
openaire +2 more sources
Friendship prediction model based on factor graphs integrating geographical location
CAAI Transactions on Intelligence Technology, 2020 With the development of network services and location-based systems, many mobile applications begin to use users’ geographical location to provide better services. In terms of social networks, geographical location is actively shared by users.
Liang Chen +7 more
doaj +1 more source
The Friendship Problem on Graphs. [PDF]
J. Multiple Valued Log. Soft Comput., 2008 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. Moreover, we generalize this theorem in a natural way, assuming that every pair of nodes occupies l ≥ 2 common neighbors.
Mertzios, G.B., Unger, W.
openaire +2 more sources
A sum labelling for the generalised friendship graph
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Henning Fernau +2 more
openaire +2 more sources
The Power of Implicit Social Relation in Rating Prediction of Social Recommender Systems. [PDF]
PLoS ONE, 2016 The explosive growth of social networks in recent times has presented a powerful source of information to be utilized as an extra source for assisting in the social recommendation problems.
Waleed Reafee, Naomie Salim, Atif Khan
doaj +1 more source
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
Modular Coloring and Switching in Some Planar Graphs
Ratio Mathematica, 2023 For a connected graph G, let c: V (G) →ℤk (k ≥ 2) be a vertex coloring of G. The color sum \sigma(v) of a vertex v of G is defined as the sum in ℤk of the colors of the vertices in N (v) that is (v) = \sum_{u\inN(v)}{c(u)} (mod k).
G. R Sanma, P Maya
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 +3 more
openaire +4 more sources