Graphs with Minimal Strength
For any graph G of order p, a bijection f:V(G)->{1,2, . . . ,p} is called a numbering of G. The strength str(f)(G) of a numbering f of G is defined by str(f)(G) = max{f(u) + f(v) vertical bar uv is an element of E(G)}, and the strength str(G) of a graph G is str(G) = min{str(f)(G) vertical bar f...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2021
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |