Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Dividing Graceful Labeling of Certain Tree Graphs
View through CrossRef
A tree is a connected acyclic graph on n vertices and m edges. graceful labeling of a tree defined as a simple undirected graph G(V,E) with order n and size m, if there exist an injective mapping that induces a bijective mapping defined by for each and . In this paper we introduce a new type of graceful labeling denoted dividing graceful then discuss this type of certain tree graphs .
Title: Dividing Graceful Labeling of Certain Tree Graphs
Description:
A tree is a connected acyclic graph on n vertices and m edges.
graceful labeling of a tree defined as a simple undirected graph G(V,E) with order n and size m, if there exist an injective mapping that induces a bijective mapping defined by for each and .
In this paper we introduce a new type of graceful labeling denoted dividing graceful then discuss this type of certain tree graphs .
Related Results
On the Graceful Game
On the Graceful Game
A graceful labeling of a graph G with m edges consists in labeling the vertices of G with distinct integers from 0 to m such that, when each edge is assigned the absolute differenc...
Twilight graphs
Twilight graphs
AbstractThis paper deals primarily with countable, simple, connected graphs and the following two conditions which are trivially satisfied if the graphs are finite:(a) there is an ...
Inter-specific variations in tree stem methane and nitrous oxide exchanges in a tropical rainforest
Inter-specific variations in tree stem methane and nitrous oxide exchanges in a tropical rainforest
<p>Tropical forests are the most productive terrestrial ecosystems, global centres of biodiversity and important participants in the global carbon and water cycles. T...
Computing the Energy of Certain Graphs based on Vertex Status
Computing the Energy of Certain Graphs based on Vertex Status
Background:
The concept of Hückel molecular orbital theory is used to compute the graph energy numerically and graphically on the base of the status of a vertex.
Objective:
Our a...
Protocol for antigen labeling in eukaryotic cells and quantification by flow cytometry v1
Protocol for antigen labeling in eukaryotic cells and quantification by flow cytometry v1
Goal: This document aims to standardize the protocol used for labeling intracellular or extracellular antigens in eukaryotic cells, using antibodies already associated with fluoroc...
Programmatic Labeling of Dark Data for Artificial Intelligence in Spatial Informatics
Programmatic Labeling of Dark Data for Artificial Intelligence in Spatial Informatics
<p>Data preparation process generally consumes up to 80% of the Data Scientists time, with 60% of that being attributed to cleaning and labeling data.[1]&#160...
The Sensitivity Feature Analysis for Tree Species Based on Image Statistical Properties
The Sensitivity Feature Analysis for Tree Species Based on Image Statistical Properties
While the statistical properties of images are vital in forestry engineering, the usefulness of these properties in various forestry tasks may vary, and certain image properties mi...
Eigenspectral Analysis of Pendant Vertex- and Pendant Edge-Weighted Graphs of Linear Chains, Cycles, and Stars
Eigenspectral Analysis of Pendant Vertex- and Pendant Edge-Weighted Graphs of Linear Chains, Cycles, and Stars
Abstract
Three classes of pendent vertex- and pendant edge-weighted graphs of linear chains (class I), stars (class II), and cycles (class III) have been presented. ...