No label defined (Q3728945)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3961666
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3961666 |
Statements
1985
0 references
graph numbering
0 references
numbering of graphs
0 references
graph labeling
0 references
labeling graphs
0 references
edge-graceful graphs
0 references
0.9815764
0 references
0.97511226
0 references
0.95445955
0 references
0.94902134
0 references
0.9461677
0 references
0.94579077
0 references
0 references
0.9407257
0 references
[For the entire collection see Zbl 0583.00003.] This paper is a further one dealing with labeling graphs. The author considers edge-graceful graphs being defined as follows: A connected graph \(G=(V(G),E(G))\) is said to be edge-graceful if, and only if, there is an edge-labeling \(g: E\to \{1,2,...,| (G)| \}\) of \(G\) such that the weights \[ w_ g(v)=\sum_{e\in E(G), \;e \text{ incident to }v }g(e)\quad (\text{mod}| V(G)|) \] for each vertex \(v\in V(G)\) are consecutive integers ranging from 0 to \(| V(G)| -1\). Analogously to the theory of the graceful graphs the author derives some properties of edge- graceful graphs, proves a necessary condition for a graph to be edge- graceful, determines some classes of edge-graceful graphs, and finishes with the conjecture: Each complete graph \(K_ p\) \((p\geq 2)\) is edge-graceful.
0 references