On the D(2)-Vertex Distinguishing Total Coloring of Graphs with Δ = 3
Mathematical Notes, ISSN: 1573-8876, Vol: 112, Issue: 1-2, Page: 142-149
2022
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Article Description
Abstract: A D(2)-vertex-distinguishing total coloring of a graph G is a proper total coloring such that no pair of vertices, within distance two, has the same set of colors, and the minimum number of colors required for such a coloring is called D(2)-vertex-distinguishing total chromatic number of G, and denoted by (Formula presented.). In this paper, we prove that (Formula presented.) for any graph G with Δ = 3.
Bibliographic Details
Pleiades Publishing Ltd
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know