Results 61 to 70 of about 547 (79)

1-Restricted Optimal Rubbling on Graphs

Discussiones Mathematicae Graph Theory, 2019
Let G be a graph with vertex set V and a distribution of pebbles on the vertices of V. A pebbling move consists of removing two pebbles from a vertex and placing one pebble on a neighboring vertex, and a rubbling move consists of removing a pebble from ...
Beeler Robert A., Haynes Teresa W., Murphy Kyle   +2 more
doaj   +1 more source

On alpha labeling of tensor product of paths and cycles. [PDF]

Heliyon, 2023
L U, G R.
europepmc   +1 more source

L(2, 1)-Labeling of Circulant Graphs

Discussiones Mathematicae Graph Theory, 2019
An L(2, 1)-labeling of a graph Γ is an assignment of non-negative integers to the vertices such that adjacent vertices receive labels that differ by at least 2, and those at a distance of two receive labels that differ by at least one.
Mitra Sarbari, Bhoumik Soumya
doaj   +1 more source

A Note on the Sparing Number of the Sieve Graphs of Certain Graphs [PDF]

, 2015
Let $\mathbb{N}_0$ denote the set of all non-negative integers and $\mathcal{P}(\mathbb{N}_0)$ be its power set. An integer additive set-indexer (IASI) of a given graph $G$ is an injective function $f:V(G)\to \mathcal{P}(\mathbb{N}_0)$ such that the ...
Germina, Augustine, Sudev, Naduvath
core   +2 more sources

Construction of Barnette graphs whose large subgraphs are non-Hamiltonian

Acta Universitatis Sapientiae: Mathematica, 2019
Barnette’s conjecture states that every three connected cubic bipartite planar graph (CPB3C) is Hamiltonian. In this paper we show the existence of a family of CPB3C Hamiltonian graphs in which large and large subgraphs are non-Hamiltonian.
Pirzada S., Shah Mushtaq A.
doaj   +1 more source

Caterpillars Have Antimagic Orientations

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2018
An antimagic labeling of a directed graph D with m arcs is a bijection from the set of arcs of D to {1, …, m} such that all oriented vertex sums of vertices in D are pairwise distinct, where the oriented vertex sum of a vertex u is the sum of labels of ...
Lozano Antoni
doaj   +1 more source

Vines and MAT-labeled graphs

Forum of Mathematics, Sigma
The present paper explores a connection between two concepts arising from different fields of mathematics. The first concept, called vine, is a graphical model for dependent random variables.
Hung Manh Tran, Tan Nhat Tran, Shuhei Tsujie   +2 more
doaj   +1 more source

Optimal L(3,2,1)-labeling of trees

AKCE International Journal of Graphs and Combinatorics
Given a graph G, an [Formula: see text]-labeling of G is an assignment f of non-negative integers (labels) to the vertices of G such that [Formula: see text] if [Formula: see text] (i = 1, 2, 3).
Xiaoling Zhang
doaj   +1 more source

On subset labelings of trees

AKCE International Journal of Graphs and Combinatorics
For a nontrivial graph G, a subset labeling of G is a labeling of the vertices of G with nonempty subsets of the set [Formula: see text] for a positive integer r such that two vertices of G have disjoint labels if and only if the vertices are adjacent ...
Gary Chartrand, Ebrahim Salehi, Ping Zhang   +2 more
doaj   +1 more source

Drawing a Graph in a Hypercube

, 2004
A $d$-dimensional hypercube drawing of a graph represents the vertices by distinct points in $\{0,1\}^d$, such that the line-segments representing the edges do not cross.
Wood, David R.
core   +2 more sources