Results 251 to 260 of about 728,663 (278)
The Total Irregularity Strength of m Copies of the Friendship Graph [PDF]
Tensor: Pure and Applied Mathematics Journal, 2022 This paper deals with the totally irregular total labeling of the disjoin union of friendship graphs. The results shows that the disjoin union of copies of the friendship graph is a totally irregular total graph with the exact values of the total ...
Harmanus Batkunde +3 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Symmetric Graph Designs on Friendship Graphs
Journal of Combinatorial Designs, 2000A 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\).
Dalibor Fronček, Alexander Rosa
exaly +3 more sources
Super (a, d)-Edge Antimagic Total Labelings of Friendship and Generalized Friendship Graphs
Electronic Notes in Discrete Mathematics, 2015 Abstract An (a, d)-edge-antimagic total labeling of a graph G with p vertices and q edges is a bijection f from the set of all vertices and edges to the set of positive integers { 1 , 2 , 3 , … , p + q } such that all the edge-weights w ( u v ) = f ( u ) + f ( v ) + f ( u v ) ; u v ∈ E ( G ...
Subramanian Arumugam
exaly +2 more sources
Line Graph of Friendship Graph and CTI
2022Topological indices are used to describe the symmetry of molecular structures and to predict features like boiling temperatures, viscosity, gyroscope radius, etc.[8] In recent work, the idea of chromatic topological indices has been explored as an coloring version of particular Zagreb indices.
A, Albina, A, Manonmani
openaire +1 more source
On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs [PDF]
Mathematics, 2017 We study an edge irregular reflexive k-labelling for the generalized friendship graphs, also known as flowers (a symmetric collection of cycles meeting at a common vertex), and determine the exact value of the reflexive edge strength for several subfamilies of the generalized friendship graphs.
Martin Baca +2 more
exaly +4 more sources
A study of a time-graph friendship model
2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, 2011Modeling 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 +2 more
openaire +1 more source
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 +2 more
openaire +2 more sources
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 +2 more
openaire +2 more sources
Journal of Graph TheoryABSTRACTIt is well‐known that Brualdi‐Hoffman‐Turán‐type problem inquiries about the maximum spectral radius of an ‐free graph with edges. This can be regarded as a spectral characterization of the existence of the subgraph within . A significant contribution to this problem was made by Nikiforov (2002).
Shuchao Li, Lantao Zou
exaly +3 more sources
Irregular colorings of friendship graph families
Journal of Discrete Mathematical Sciences and Cryptography, 2020In 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
Friendship-Like Graphs and It’s Classiffication
2020A 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 +2 more
openaire +1 more source