Results 91 to 100 of about 140,706 (235)
Extra Skolem Difference Mean Labeling of Various Graphs
, 2021 Urvisha Vaghela, Dharamvirsinh Parmar
openalex +2 more sources
Online Speaker Diarization with Graph-based Label Generation [PDF]
, 2021 Yucong Zhang +6 more
openalex
The Reflexive H-Strength on Some Graphs
Cauchy: Jurnal Matematika Murni dan AplikasiLet G be a connected, simple, and undirected graph with a vertex set V(G) and an edge set E(G). The irregular reflexive -labeling is defined by the function and such that if and if , where max .
Lusia Herni Sullystiawati +3 more
doaj +1 more source
Characterization of certain families of modular multiplicative divisor graphs
Journal of Taibah University for Science, 2017 A modular multiplicative divisor (MMD) labelling of a graph G with p vertices and q edges is a bijection f from the set of all vertices to the set of positive integers {1, 2, …, p} such that the sum of all edge labels f*(uv) = f(u)f(v)(modp); uv ∈ E(G ...
R. Revathi, S. Ganesh
doaj +1 more source
Prime Labelings of Snake Graphs
The PUMP Journal of Undergraduate Research, 2019 A prime labeling of a graph G with n vertices is a labeling of the vertices with distinct integers from the set {1, 2 ,..., n} such that the labels of any two adjacent vertices are relatively prime. In this paper, we introduce a snake graph, the fused union of identical cycles, and define a consecutive snake prime labeling for this new family of graphs.
Abigail Bigham +4 more
openaire +2 more sources
Inverse eigenvalue problems for acyclic matrices whose graph is a dense centipede
Special Matrices, 2018 The reconstruction of a matrix having a pre-defined structure from given spectral data is known as an inverse eigenvalue problem (IEP). In this paper, we consider two IEPs involving the reconstruction of matrices whose graph is a special type of tree ...
Sharma Debashish, Sen Mausumi
doaj +1 more source
GraphGen-Redux: a Fast and Lightweight Recurrent Model for labeled Graph Generation [PDF]
, 2021 Marco Podda, Davide Bacciu
openalex +1 more source
A STUDY ON PERFECT ITALIAN DOMINATION OF GRAPHS AND THEIR COMPLEMENTS
Ural Mathematical JournalPerfect Italian Domination is a type of vertex domination which can also be viewed as a graph labelling problem. The vertices of a graph \(G\) are labelled by 0, 1 or 2 in such a way that a vertex labelled 0 should have a neighbourhood with exactly two ...
Agnes Poovathingal +1 more
doaj +1 more source
Debiased Graph Neural Networks with Agnostic Label Selection Bias [PDF]
, 2022 Shaohua Fan +5 more
openalex +1 more source