Results 61 to 70 of about 2,422,838 (348)
The Odd Harmonious Labeling of Layered Graphs
JTAM (Jurnal Teori dan Aplikasi Matematika), 2023 Graphs that have the properties of odd harmonious labeling are odd harmonious graphs. The research objective of this paper is to obtain odd harmonious labeling on layered graph C(x,y) and layered graph D(x,y).
Fery Firmansah
doaj +1 more source
Graphs with average labellings
Discrete Mathematics, 2001 AbstractFor a given simple graph an average labelling is defined. The graphs with average labellings and all the admissible average labellings for such graphs are characterized.
Roman Soták, Matúš Harminc
openaire +2 more sources
On the number of unlabeled vertices in edge-friendly labelings of graphs [PDF]
, 2011 Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and $f$ be a 0-1 labeling of $E(G)$ so that the absolute difference in the number of edges labeled 1 and 0 is no more than one. Call such a labeling $f$ \emph{edge-friendly}.
Cahit +8 more
core +2 more sources
Swapping Labeled Tokens on Graphs [PDF]
Theoretical Computer Science, 2014 Consider a puzzle consisting of n tokens on an n-vertex graph, where each token has a distinct starting vertex and a distinct target vertex it wants to reach, and the only allowed transformation is to swap the tokens on adjacent vertices. We prove that every such puzzle is solvable in O(n 2) token swaps, and thus focus on the problem of minimizing the ...
Yamanaka, Katsuhisa +9 more
openaire +6 more sources
Theory and Applications of Graphs, 2020 In his classical paper [14], Rosa introduced a hierarchical series of labelings called ρ, σ, β and α labeling as a tool to settle Ringel’s Conjecture which states that if T is any tree with m edges then the complete graph K2m+1 can be decomposed into 2m +
G. Sethuraman, M. Sujasree
doaj +1 more source
On the Implicit Graph Conjecture [PDF]
, 2016 The implicit graph conjecture states that every sufficiently small, hereditary graph class has a labeling scheme with a polynomial-time computable label decoder.
Chandoo, Maurice
core +3 more sources
A Study on Topological Integer Additive Set-Labeling of Graphs [PDF]
, 2015 A set-labeling of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(X)$, where $X$ is a finite set and a set-indexer of $G$ is a set-labeling such that the induced function $f^{\oplus}:E(G)\to \mathcal{P}(X)-\{\emptyset\}$ defined by $f^{\oplus}
Germina, K. A., Sudev, N. K.
core +3 more sources
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
Information Processing Letters, 2009 Suppose the vertices of a graph G were labeled arbitrarily by positive integers, and let S(v) denote the sum of labels over all neighbors of vertex v. A labeling is lucky if the function S is a proper coloring of G, that is, if we have S(u) S(v) whenever u and v are adjacent.
Czerwiński, Sebastian +2 more
openaire +2 more sources
Canonical Labelling of Site Graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 In Proceedings CompMod 2013, arXiv:1306 ...
Michael Pedersen +2 more
openaire +4 more sources