Javascript must be enabled to continue!

Orthogonal labeling

<div class="page" title="Page 1"><div class="layoutArea"><div class="column">Let ∆G be the maximum degree of a simple connected graph G(V,E). An injective mapping P : V → R∆G is said to be an orthogonal labeling of G if uv,uw ∈ E implying (P(v) − P(u)) · (P(w) − P(u)) = 0, where · is the usual dot product defined in Euclidean space. A graph G which has an orthogonal labeling is called an orthogonal graph. This labeling is motivated by the existence of several labelings defined by some algebraic structure, i.e. harmonious labeling and group distance magic labeling. In this paper we study some preliminary results on orthogonal labeling. One of the early result is the fact that cycle graph with even vertices are orthogonal, while ones with odd vertices are not. The main results in this paper state that any graph containing K3 as its subgraph is non-orthogonal and that a graph G′ obtained from adding a pendant to a vertex in orthogonal graph G is orthogonal. In the end of the paper we state the corollary that any tree is orthogonal. </div></div></div>

UPT Penerbitan Universitas Jember

Bernard Immanuel Kiki A. Sugeng

Indonesian Journal of Combinatorics

2017

Title: Orthogonal labeling

Description:

An injective mapping P : V → R∆G is said to be an orthogonal labeling of G if uv,uw ∈ E implying (P(v) − P(u)) · (P(w) − P(u)) = 0, where · is the usual dot product defined in Euclidean space.

A graph G which has an orthogonal labeling is called an orthogonal graph.

This labeling is motivated by the existence of several labelings defined by some algebraic structure, i.

harmonious labeling and group distance magic labeling.

In this paper we study some preliminary results on orthogonal labeling.

One of the early result is the fact that cycle graph with even vertices are orthogonal, while ones with odd vertices are not.

The main results in this paper state that any graph containing K3 as its subgraph is non-orthogonal and that a graph G′ obtained from adding a pendant to a vertex in orthogonal graph G is orthogonal.

In the end of the paper we state the corollary that any tree is orthogonal.

</div></div></div>.

Back

The seventh in the series of ETP Symposia (see Rapid Communications in Mass Spectrometry 2012, 26 , ...

Active Learning Query by Committee Labeling Method to Increase Accuracy and Efficiency of Sentiment Analysis Classification

This study proposes the Query by Committee (QBC) labeling method to improve the accuracy of classification models—specifically XLM-RoBERTa—and to increase labeling efficiency compa...

Quantitative Evaluation of a Standard for Immunogold Labeling of Collagen Type IV

Abstract Quantitative gold labeling studies allow the comparison of tissue antigens only if labeling conditions are the same. When labeling conditions deviate slight...

N‐Terminal Protein Labeling with N‐Hydroxysuccinimide Esters and Microscale Thermophoresis Measurements of Protein‐Protein Interactions Using Labeled Protein

AbstractProtein labeling strategies have been explored for decades to study protein structure, function, and regulation. Fluorescent labeling of a protein enables the study of prot...

Fibonacci Prime Labelling on the Class of Flower Graphs

Graph labeling is one of the significant topics in graph theory. One of its interesting variants is Fibonacci prime labeling, a special type of labeling that assigns Fibonacci numb...

Optimized metrics for orthogonal combinatorial CRISPR screens

CRISPR screening has become a powerful technology to identify genetic dependencies with single-gene resolution. Genomic codependencies can be extracted with CRISPR perturbation scr...

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...

New Orthogonal Transforms for Signal and Image Processing

In the paper, orthogonal transforms based on proposed symmetric, orthogonal matrices are created. These transforms can be considered as generalized Walsh–Hadamard Transforms. The s...

Email:
Password:

Email:

Orthogonal labeling

Related Results