On the distinguishing number of functigraphs (Q2333653)
From MaRDI portal
!
WARNING
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 7129311
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the distinguishing number of functigraphs |
scientific article; zbMATH DE number 7129311 |
Statements
On the distinguishing number of functigraphs (English)
0 references
13 November 2019
0 references
Summary: Let \(G_1\) and \(G_2\) be disjoint copies of a graph \(G\) and \(g : V(G_1) \rightarrow V(G_2)\) be a function. A functigraph \(F_G\) consists of the vertex set \(V(G_1) \cup V(G_2)\) and the edge set \(E(G_1) \cup E(G_2) \cup \{u v : g(u) = v \}\). In this paper, we extend the study of distinguishing numbers of a graph to its functigraph. We discuss the behavior of distinguishing number in passing from \(G\) to \(F_G\) and find its sharp lower and upper bounds. We also discuss the distinguishing number of functigraphs of complete graphs and join graphs.
0 references
distinguishing number
0 references
functigraph
0 references
complete graph
0 references
0.8505991697311401
0 references
0.8237855434417725
0 references
0.8068720102310181
0 references
0.8042804598808289
0 references
0.7700923085212708
0 references
