Results 1 to 10 of about 728,663 (278)
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 +6 more sources
Gendered Spaces, Gendered Friendship Networks? Exploring the Organizing Patterns of LGBTQ Youth
International Journal of Communication, 2019 Research has found a tendency for youth to develop friendships with same-gender peers. Whether this is due to a preference for same-gender friends or is an outcome of communication constraints from gender-segregated physical spaces and social practices ...
Traci Gillig, Leila Bighash
doaj
PMC-LABELING OF SOME CLASSES OF GRAPHS CONTAINING CYCLES
BarekengLet be a graph with p vertices and q edges. We have introduced a new graph labeling method using integers and cordial-related works and investigated some graphs for this labeling technique.
R Ponraj, S Prabhu, M Sivakumar
doaj +1 more source
Modular H-Irregularity Strength of Graphs
MathematicsTwo new graph characteristics, the modular edge H-irregularity strength and the modular vertex H-irregularity strength, are introduced. Lower bounds on these graph characteristics are estimated, and their exact values are determined for certain families ...
Martin Bača +2 more
doaj +1 more source
Embodied Learning of Graphs: A Psychodramatic Approach in Primary School
Informatics in EducationWhile graph theory plays a foundational role in informatics and computational thinking (CT), its instruction in elementary education remains underexplored, particularly through embodied or arts-based methods.
João Marcelo BOROVINA JOSKO +1 more
doaj +1 more source
Brouwer's conjecture for the sum of the k largest Laplacian eigenvalues of some graphs
Open MathematicsLet GG be a graph with n(G)n\left(G) vertices and e(G)e\left(G) edges, and Sk(G){S}_{k}\left(G) be the sum of the kk largest Laplacian eigenvalues of GG. Brouwer conjectured that Sk(G)≤e(G)+k+12{S}_{k}\left(G)\le e\left(G)+\left(\phantom{\rule[-0.75em]{}{
Wang Ke +3 more
doaj +1 more source
Journal of Statistical Software, 2007 The statnet suite of R packages contains a wide range of functionality for the statistical analysis of social networks, including the implementation of exponential-family random graph (ERG) models. In this paper we illustrate some of the functionality of
Steven M. Goodreau +4 more
doaj
A comprehensive generalization of the Friendship Paradox to weights and attributes
Scientific ReportsThe Friendship Paradox is a simple and powerful statement about node degrees in a graph. However, it only applies to undirected graphs with no edge weights, and the only node characteristic it concerns is degree.
Anna Evtushenko, Jon Kleinberg
doaj +1 more source
On local distance antimagic labeling of graphs
AKCE International Journal of Graphs and CombinatoricsLet [Formula: see text] be a graph of order n and let [Formula: see text] be a bijection. For every vertex [Formula: see text], we define the weight of the vertex v as [Formula: see text] where N(v) is the open neighborhood of the vertex v. The bijection
Adarsh Kumar Handa +2 more
doaj +1 more source
On Coloring of Fractional Powers of Star, Wheel, Friendship, and Fan Graphs
Indonesian Journal of CombinatoricsLet G be a simple, connected, and undirected graph. For m, n ∈ ℕ, the fractional power Gm/n = (G1/n)m of G is constructed by taking the n-subdivision of G (replacing each edge by a path of length n), and then raising the resulting graph to the m-th power
Farisan Hafizh +4 more
doaj +1 more source