Results 51 to 60 of about 280,140 (285)

Swapping Labeled Tokens on Graphs [PDF]

Theoretical Computer Science, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki 0001, Kei Uchizawa, Takeaki Uno   +9 more
openaire   +6 more sources

Applications of Automata and Graphs: Labeling-Operators in Hilbert Space I [PDF]

, 2008
We show that certain representations of graphs by operators on Hilbert space have uses in signal processing and in symbolic dynamics. Our main result is that graphs built on automata have fractal characteristics.
Fannes M., Gibbons A., Gill A., Hopcroft J. E., Ilwoo Cho, Kadison R. V., Marshall C. W., Palle E. T. Jorgensen, Scapellato R., Schiff J. L., Speicher R., Voiculescu D.   +11 more
core   +2 more sources

Skolem labelled graphs

Discrete Mathematics, 1991
This paper deals with so-called \(d\)-Skolem labelled graphs and \(d\)-hooked Skolem labelled graphs. After quoting and representing main results in terms of \(d\)-Skolem labelled graphs the authors prove a lot of new theorems. Most of them give new classes of \(d\)-Skolem labelled graphs.
Eric Mendelsohn, Nabil Shalaby
openaire   +2 more sources

PMC-LABELING OF SOME CLASSES OF GRAPHS CONTAINING CYCLES

Barekeng
Let 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

Neutrosophic Divisor Cordial Labeling Graphs [PDF]

Neutrosophic Sets and Systems
In this paper we introduced a novel concept – Neutrosophic Divisor Cordial Labeling a have proved that graphs such as wheels, helms and closed helm graph satisfy this new labeling. This paper builds upon our previous work in Neutrosophic Cordial Labeling
Tephilla Joice P, A.Rajkumar
doaj   +1 more source

On Integer Cordial Labeling of Some Families of Graphs

Ratio Mathematica, 2022
An integer cordial labeling of a graph $G(p,q)$ is an injective map $f:V\rightarrow [-\frac{p}{2}...\frac{p}{2}]^*$ or $[-\lfloor{\frac{p}{2}\rfloor}...\lfloor{\frac{p}{2}\rfloor}]$ as $p$ is even or odd, which induces an edge labeling $f^*: E ...
S Sarah Surya, Lian Mathew, Alan Thomas
doaj   +1 more source

Weak Set-Labeling Number of Certain IASL-Graphs

, 2015
Let $\mathbb{N}_0$ be the set of all non-negative integers, let $X\subset \mathbb{N}_0$ and $\mathcal{P}(X)$ be the the power set of $X$. An integer additive set-labeling (IASL) of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(\mathbb{N}_0)$
Chithra, K. P., Germina, K. A., Sudev, N. K.   +2 more
core   +1 more source

On a labeling problem in graphs

Discrete Applied Mathematics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R. Chandrasekaran, Milind Dawande, Mehmet Baysan   +2 more
openaire   +1 more source

On Square Sum Labeling of Two Families of Petersen Graphs

Journal of Mathematics, 2022
A labeling on a graph G with n vertices and m edges is called square sum if there exists a bijection f:VG⟶0,1,2,3,…,n−1 such that the function f∗:EG⟶N defined by f∗st=fs2+ft2, for all st∈EG, is injective.
Zhiqiang Zhang, Muhammad Naeem, Abeera Tariq, Weidong Zhao   +3 more
doaj   +1 more source

On the Graceful Game [PDF]

, 2020
A graceful labeling of a graph $G$ with $m$ edges consists of labeling the vertices of $G$ with distinct integers from $0$ to $m$ such that, when each edge is assigned as induced label the absolute difference of the labels of its endpoints, all induced ...
Dantas, Simone, Frickes, Luisa, Luiz, Atílio G.   +2 more
core   +2 more sources