Results 221 to 230 of about 2,715 (247)

Friendship Two-Graphs

Graphs and Combinatorics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Endre Boros, Boros Endre
exaly   +2 more sources

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, Afroditi Loukidou, Spyros Sioutas   +2 more
openaire   +1 more source

Beyond friendship graphs

Proceedings of the 2nd ACM workshop on Online social networks, 2009
Most of the existing literature on empirical studies of Online Social Networks (OSNs) have focused on characterizing and modeling the structure of their inferred friendship graphs. However, the friendship graph of an OSN does not demonstrate what fraction of its users actively interact with other users, how these users interact, and how these active ...
Masoud Valafar, Reza Rejaie, Walter Willinger   +2 more
openaire   +1 more source

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
openaire   +1 more source

Degrees of Vertices in a Friendship Graph

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
openaire   +1 more source

Friendship-Like Graphs and It’s Classiffication

2020
A distance-compatible set-labeling (dcsl) of a connected graph G is an injective set assignment \(f : V(G) \rightarrow 2^{X},\) X being a nonempty set, such that the corresponding induced function \(f^{\oplus } :V(G)\times V(G) \rightarrow 2^{X}\) given by \(f^{\oplus }(uv)= f(u)\oplus f(v)\) satisfies \(\mid f^{\oplus }(uv) \mid = k_{(u,v)}^{f}d_{G}(u,
K. Nageswara Rao, P. Shaini, K. A. Germina   +2 more
openaire   +1 more source

\([r,s,t]\)-colorings of friendship graphs and wheels

Graphs Comb., 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wei Liao, Mingchu Li
openaire   +1 more source

Cardinality of Hajós Graphs and Hajós Fuzzy Graphs on Fan Graph, Lollipop Graph, Friendship Graph, Tadpole Graph and Crown Graph

International Journal of Fuzzy Mathematical Archive
Hajos Fuzzy graph is a new fuzzy graph obtained by applying a binary operation, named Hajos construction, on two fuzzy graphs. The Hajos construction on two (fuzzy) graphs produces many different (fuzzy) graphs depending on the choice of vertices and edges.
K. Radha, A. Jasmine Kingsly
openaire   +1 more source