Results 11 to 20 of about 4,787 (279)
Group vertex magicness of H-join and generalised friendship graph [PDF]
Electronic Journal of Graph Theory and ApplicationsIn this paper, we consider A-vertex magic graphs, where A is a non-trivial Abelian group. We characterize Z-vertex magic graphs. We also explore the relation between the A-vertex magicness of a graph G and its reduced graph.
S. Balamoorthy, S.V. Bharanedhar
doaj +5 more sources
Modular Irregular Labeling on Double-Star and Friendship Graphs [PDF]
Journal of Mathematics, 2021 A modular irregular graph is a graph that admits a modular irregular labeling. A modular irregular labeling of a graph G of order n is a mapping of the set of edges of the graph to 1,2,…,k such that the weights of all vertices are different.
K. A. Sugeng +3 more
doaj +2 more sources
The eccentricity spread of weak-friendship graphs [PDF]
Discrete Mathematics Letters, 2023 Summary: A weak-friendship graph is a connected induced subgraph of a friendship graph. The unique graphs attaining the first two smallest eccentricity spread in the class of weak-friendship graphs of given order are determined in this paper.
Jia X., Li X., Brunetti M.
openaire +5 more sources
The Complexity of Octopus Graph, Friendship Graph, and Snail Graph [PDF]
EduMatSains : Jurnal Pendidikan, Matematika dan SainsGraphs are basic structures that represent objects with nodes and relationships between objects with edges. Trees are one of the parts studied in graph theory along with finding the number of spanning trees of a graph such as octopus graph, friendship graph, and snail graph.
Fransiskus Fran +4 more
openaire +3 more sources
A C3 Magic Decomposition on Friendship Graph with Odd Order [PDF]
Jurnal Ilmu Dasar, 2022 Let G = (V,E) is graph with a non-empty set V containing vertices and a set of edges E. Also note that if H = {H_i⊆G_i = 1,2,3,...,n} is a collection of subgraphs from G with H_i≅Hj,i ≠ j.
Indah Chairun Nisa +2 more
doaj +2 more sources
Node-based generalized friendship paradox fails [PDF]
Scientific Reports, 2023 The Friendship Paradox—the principle that “your friends have more friends than you do”—is a combinatorial fact about degrees in a graph; but given that many web-based social activities are correlated with a user’s degree, this fact has been taken more ...
Anna Evtushenko, Jon Kleinberg
doaj +3 more sources
On The Locating-Chromatic Numbers of Subdivisions of Friendship Graph [PDF]
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 +3 more sources
Analyzing the Facebook Friendship Graph [PDF]
CoRR, 2010 6 pages, 1 figure; MIFI '10: Proceedings of the 1st International Workshop on Mining the Future ...
CATANESE Salvatore +3 more
openaire +5 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
exaly +3 more sources
Friendship Decompositions of Graphs: The general problem [PDF]
Open Journal of Applied Sciences, 2012 A friendship graph is a graph consisting of cliques sharing a common vertex. In this paper we investigate the maximum number of elements in an optimal friendship decomposition of graphs of order n. We obtain upper and lower bounds for this number. These bounds relate this problem with the classical Ramsey numbers.
Teresa Sousa
openaire +2 more sources