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

Izvestiya of Saratov University. New Series. Series: Mathematics. Mechanics. Informatics
doi 10.18500/1816-9791-2013-13-2-1-105-111
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Saratov State University

Related search

The Upper Connected Vertex Detour Number of a Graph

Filomat
Mathematics
2012English

Finding Vertex-Surjective Graph Homomorphisms

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
2012English

Vertex-Uncertainty in Graph-Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Connectedness of the Graph of Vertex-Colourings

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2008English

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

Arabian Journal for Science and Engineering
Multidisciplinary
2011English

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

Scholars Journal of Physics, Mathematics and Statistics
2020English

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

Journal of Engineering Science and Technology Review
Engineering
2020English

On Total Vertex-Edge Domination

2018English

A Shortest Cycle for Each Vertex of a Graph

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy