Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Orthogonal labeling

View through CrossRef
<div class="page" title="Page 1"><div class="layoutArea"><div class="column"><p><span>Let ∆</span><span>G </span><span>be the maximum degree of a simple connected graph </span><span>G</span><span>(</span><span>V,E</span><span>). An injective mapping </span><span>P </span><span>: </span><span>V </span><span>→ </span><span>R</span><span>∆</span><span>G </span><span>is said to be an orthogonal labeling of </span><span>G </span><span>if </span><span>uv,uw </span><span>∈ </span><span>E </span><span>implying (</span><span>P</span><span>(</span><span>v</span><span>) </span><span>− </span><span>P</span><span>(</span><span>u</span><span>)) </span><span>· </span><span>(</span><span>P</span><span>(</span><span>w</span><span>) </span><span>− </span><span>P</span><span>(</span><span>u</span><span>)) = 0, where </span><span>· </span><span>is the usual dot product defined in Euclidean space. A graph </span><span>G </span><span>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 </span><span>K</span><span>3 </span><span>as its subgraph is non-orthogonal and that a graph </span><span>G</span><span>′ </span><span>obtained from adding a pendant to a vertex in orthogonal graph </span><span>G </span><span>is orthogonal. In the end of the paper we state the corollary that any tree is orthogonal.<br /> </span></p></div></div></div>
Title: Orthogonal labeling
Description:
<div class="page" title="Page 1"><div class="layoutArea"><div class="column"><p><span>Let ∆</span><span>G </span><span>be the maximum degree of a simple connected graph </span><span>G</span><span>(</span><span>V,E</span><span>).
An injective mapping </span><span>P </span><span>: </span><span>V </span><span>→ </span><span>R</span><span>∆</span><span>G </span><span>is said to be an orthogonal labeling of </span><span>G </span><span>if </span><span>uv,uw </span><span>∈ </span><span>E </span><span>implying (</span><span>P</span><span>(</span><span>v</span><span>) </span><span>− </span><span>P</span><span>(</span><span>u</span><span>)) </span><span>· </span><span>(</span><span>P</span><span>(</span><span>w</span><span>) </span><span>− </span><span>P</span><span>(</span><span>u</span><span>)) = 0, where </span><span>· </span><span>is the usual dot product defined in Euclidean space.
A graph </span><span>G </span><span>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 </span><span>K</span><span>3 </span><span>as its subgraph is non-orthogonal and that a graph </span><span>G</span><span>′ </span><span>obtained from adding a pendant to a vertex in orthogonal graph </span><span>G </span><span>is orthogonal.
In the end of the paper we state the corollary that any tree is orthogonal.
<br /> </span></p></div></div></div>.

Related Results

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
&lt;p&gt;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]&amp;#160...
Functionalized polysaccharides improve sensitivity of tyramide/peroxidase proximity labeling assays through electrostatic interactions
Functionalized polysaccharides improve sensitivity of tyramide/peroxidase proximity labeling assays through electrostatic interactions
High-throughput assays that efficiently link genotype and phenotype with high fidelity are key to successful enzyme engineering campaigns. Among these assays, the tyramide/peroxida...
Competitiveness Assessment of Tonic Drinks Labeling
Competitiveness Assessment of Tonic Drinks Labeling
Labeling of alcoholic-free tonic beverages (AFTB) is an important element in the quality indicators system. Not all manufacturers, unfortunately, provide reliable information regar...
Order-of-Addition Orthogonal Arrays with High Strength
Order-of-Addition Orthogonal Arrays with High Strength
In order-of-addition experiments, the full order-of-addition designs are often unaffordable due to their large run sizes. The problem of finding efficient fractional OofA designs a...
Mass Spectrometry of Peptides and Proteins
Mass Spectrometry of Peptides and Proteins
Abstract Originally published in: Proteomics in Drug Research. Edited by Michael Hamacher, Katrin Marcus, Kai Stühler, André van Hall, Bettina Warscheid and Helmut E. Mey...
k-super cube root cube mean labeling of graphs
k-super cube root cube mean labeling of graphs
Consider a graph G with |V (G)| = p and |E(G)| = q and let f : V (G) → {k, k + 1, k + 2, . . . p + q + k − 1}} be an injective function. The induced edge labeling f ∗ for a vertex ...
Perbandingan Performa Labeling Lexicon InSet dan VADER pada Analisa Sentimen Rohingya di Aplikasi X dengan SVM
Perbandingan Performa Labeling Lexicon InSet dan VADER pada Analisa Sentimen Rohingya di Aplikasi X dengan SVM
Rohingya in Indonesia has become trending conversation on social media. Sentiment analysis can get public responds. Big data makes the problem time efficiency labeling process, the...

Back to Top