Results 21 to 30 of about 140,706 (235)
Radial Radio Number of Hexagonal and Its Derived Networks
International Journal of Mathematics and Mathematical Sciences, 2021 A mapping ℸ: VG⟶N∪0 for a connected graph G=V,E is called a radial radio labelling if it satisfies the inequality ℸx− ℸ y+dx,y≥radG+1∀x,y∈VG, where radG is the radius of the graph G.
Kins Yenoke +3 more
doaj +1 more source
Barekeng, 2023 Graph labeling can be implemented in solving problems for various fields of life. One of the application of graph labelling is in security system.
Rafiantika Megahnia Prihandini +1 more
doaj +1 more source
On labeled graph $C^*$-algebras
Rocky Mountain Journal of Mathematics, 2020 Given a directed graph $E$ and a labeling $\mathcal{L}$, one forms the labeled graph $C^*$-algebra by taking a weakly left--resolving labeled space $(E, \mathcal{L}, \mathcal{B})$ and considering a universal generating family of partial isometries and projections.
Banjade, Debendra P., Ephrem, Menassie
openaire +4 more sources
Discrete Mathematics, 2013 Which graphs admit an integer value harmonic function which is injective and surjective onto $\Z$? Such a function, which we call harmonic labeling, is constructed when the graph is the $\Z^2$ square grid. It is shown that for any finite graph $G$ containing at least one edge, there is no harmonic labeling of $ G \times \Z$.
Benjamini, Itai +3 more
openaire +2 more sources
Bounding the monomial index and (1,l)-weight choosability of a graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Ben Seamone
doaj +1 more source
Perfect (super) Edge-Magic Crowns [PDF]
, 2017 A graph G is called edge-magic if there is a bijective function f from the set of vertices and edges to the set {1,2,…,|V(G)|+|E(G)|} such that the sum f(x)+f(xy)+f(y) for any xy in E(G) is constant. Such a function is called an edge-magic labelling of G
López Masip, Susana Clara +2 more
core +4 more sources
Enumeration Of Labelled Graphs [PDF]
Canadian Journal of Mathematics, 1956 1. Introduction. The number of connected linear graphs having V vertices labelled 1, … , V and λ (unlabelled) lines is found below. Similar formulas are found for graphs in which slings, lines “in parallel,” or both are allowed and for directed graphs with or without slings or parallel lines.
openaire +2 more sources
Egyptian Informatics Journal, 2012 Many schema labelling approaches have been designed to facilitate querying of XML documents. The proposed algorithms are based on the fact that ancestor–descendant relationships among nodes can be quickly determined.
Awny Sayed +2 more
doaj +1 more source
Connected Square Network Graphs
Universal Journal of Mathematics and Applications, 2022 In this study, connected square network graphs are introduced and two different definitions are given. Firstly, connected square network graphs are shown to be a Hamilton graph.
Burhan Selçuk
doaj +1 more source
Parallelism Detection Using Graph Labelling
Lobachevskii Journal of Mathematics, 2022 Usage of multiprocessor and multicore computers implies parallel programming. Tools for preparing parallel programs include parallel languages and libraries as well as parallelizing compilers and convertors that can perform automatic parallelization. The basic approach for parallelism detection is analysis of data dependencies and properties of program
Telegin, P. N. +3 more
openaire +2 more sources