This paper surveys the applications of Smarandache’s notion to graph theory
appeared in International J.Math.Combin. from Vol.1,2008 to Vol.3,2009. In fact, many problems discussed in these papers are generalized in this paper

Linfan Mao

English

This paper surveys the applications of Smarandache’s notion to graph theory appeared in International J.Math.Combin. from Vol.1,2008 to Vol.3,2009. In fact, many problems discussed in these papers are generalized in this paper. Topics covered in thi

CiteSeerX

Labeling, Covering and Decomposing of Graphs -- Smarandache’s Notion in Graph Theory

Mao, Linfan

ZENODO

A.Nagarajan and G.Mahadevan, Decomposition of graphs into internally disjoint trees,

Adjacent vertex distinguishing total coloring on Pm ∨

Automorphism Groups of Maps, Surfaces and Smarandache Geometries,

Combinatorial Fields - An Introduction,

On Smarandachely Adjacent Edge Coloring of a Class of Extended Petersen Graph,

On the AVSDT-Coloring of Sm+Wn,

On the Smarandachely Adjacent Vertex Total Coloring of k-Cube Graph,

On the Smarandachely-adjacent-vertex edge coloring of some double graphs,

Open Distance-Pattern Uniform Graphs,

Path double covering number of product graphs,

Simple path covers in graphs,

Smarandache Multi-Space Theory, Hexis,

Smarandachely Adjacent Vertex Totol of Graph Pm

Smarandachely k-Constrained labeling of Graphs,

Some Results on Super Mean Graphs,

The Smarandachely adjacent-vertex total coloring of three classes

Labeling, Covering and Decomposing of Graphs — Smarandache’s Notion in Graph Theory

https://zenodo.org/record/9258/files/LabelingCovering.pdf

Labeling, Covering and Decomposing of Graphs — Smarandache's Notion in Graph Theory

Labeling, Covering and Decomposing of Graphs — Smarandache's Notion in Graph Theory

Abstract

Similar works

Full text

Available Versions

CiteSeerX

ZENODO