Vertex Distinguishing General-Total Coloring of K2, 5, P

Scholars Journal of Physics, Mathematics and Statistics
doi 10.36347/sjpms.2020.v07i01.001
Full Text
Abstract

Available in full text

Date
Authors
Publisher

SASPR Edu International Pvt. Ltd

Related search

Strong Vertex-Distinguishing Total Coloring Algorithm for Complete Graphs Based on Equitable Coloring

Journal of Engineering Science and Technology Review
Engineering
2020English

Acyclic Vertex Coloring of Graphs of Maximum Degree 5

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2011English

Erratum To: Vertex-Distinguishing E-Total Colorings of Graphs

Arabian Journal for Science and Engineering
Multidisciplinary
2011English

On R - Dynamic Vertex Coloring of Some Graphs

Kongunadu Research Journal
2020English

On Upper Bound of Vertex Distinguishing Word Length on Vertex Labeled Graph

Izvestiya of Saratov University. New Series. Series: Mathematics. Mechanics. Informatics
2013English

Automatically Generated Algorithms for the Vertex Coloring Problem

PLoS ONE
Multidisciplinary
2013English

On(k,kn-K2-2k-1)-Choosability Ofn-Vertex Graphs

International Journal of Mathematics and Mathematical Sciences
Mathematics
2015English

Total Edge–vertex Domination

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
2020English

Vertex Coloring of Graphs via Phase Dynamics of Coupled Oscillatory Networks

Scientific Reports
Multidisciplinary
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy