On the Number ofα-Labeled Graphs

Christian Barrientos; Sarah Minion

Discussiones Mathematicae Graph Theory (2018)

  • Volume: 38, Issue: 1, page 177-188
  • ISSN: 2083-5892

Abstract

top
When a graceful labeling of a bipartite graph places the smaller labels in one of the stable sets of the graph, it becomes an α-labeling. This is the most restrictive type of difference-vertex labeling and it is located at the very core of this research area. Here we use an extension of the adjacency matrix to count and classify α-labeled graphs according to their size, order, and boundary value.

How to cite

top

Christian Barrientos, and Sarah Minion. "On the Number ofα-Labeled Graphs." Discussiones Mathematicae Graph Theory 38.1 (2018): 177-188. <http://eudml.org/doc/288545>.

@article{ChristianBarrientos2018,
abstract = {When a graceful labeling of a bipartite graph places the smaller labels in one of the stable sets of the graph, it becomes an α-labeling. This is the most restrictive type of difference-vertex labeling and it is located at the very core of this research area. Here we use an extension of the adjacency matrix to count and classify α-labeled graphs according to their size, order, and boundary value.},
author = {Christian Barrientos, Sarah Minion},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {α-labeling; α-graph; graceful triangle},
language = {eng},
number = {1},
pages = {177-188},
title = {On the Number ofα-Labeled Graphs},
url = {http://eudml.org/doc/288545},
volume = {38},
year = {2018},
}

TY - JOUR
AU - Christian Barrientos
AU - Sarah Minion
TI - On the Number ofα-Labeled Graphs
JO - Discussiones Mathematicae Graph Theory
PY - 2018
VL - 38
IS - 1
SP - 177
EP - 188
AB - When a graceful labeling of a bipartite graph places the smaller labels in one of the stable sets of the graph, it becomes an α-labeling. This is the most restrictive type of difference-vertex labeling and it is located at the very core of this research area. Here we use an extension of the adjacency matrix to count and classify α-labeled graphs according to their size, order, and boundary value.
LA - eng
KW - α-labeling; α-graph; graceful triangle
UR - http://eudml.org/doc/288545
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.