scientific article; zbMATH DE number 15351
[For the entire collection see Zbl 0698.00017.] A weighting \(w\) of a simple graph \(G\) is a function that assigns to each edge of \(G\) a positive integer. The weighting \(w\) is said to be admissible if the sums of the weights at each vertex are all distinct. This paper is concerned with the evaluation of the parameter \(i(G)\), which is the minimum cardinality of the image of \(w\) over all admissible weightings \(w\) of \(G\). The authors evaluate \(i(G)\) for complete graphs, complete bipartite graphs, cycles, paths, irreducible trees, and several other families of graphs. They also prove that if \(G\) is a graph of order \(n\) such that \(i(G)\) is finite, then \(i(G)\leq n-1\), except that \(i(K_ 3)=3\).
- On the number of irregular assignments on a graph
- Codings of graphs with binary edge labels
- Binary labeling of graphs
- Vertex-distinguishing edge-colorings of 2-regular graphs
- Distant total sum distinguishing index of graphs
- A smallest irregular oriented graph containing a given diregular one
- The irregular coloring number of a tree
- A note on the total detection numbers of cycles
- On the total detection numbers of complete bipartite graphs
- scientific article; zbMATH DE number 1416477 (Why is no real title available?)
- An exact algorithm for the adjacent vertex distinguishing sum edge coloring problem
- A note on sequences variant of irregularity strength for hypercubes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3971995)
