Graphoidal Tree d - Cover

Acharya and Sampathkumar defined a graphoidal cover as a partition of edges into internally disjoint (not necessarily open) paths. If we consider only open paths in the above definition then we call it as a graphoidal path cover

A Variation of Decomposition Under a Length Constraint

Introducing and initiating a study of a new variation of decomposition namely equiparity induced path decomposition of a graph which is defined to be a decomposition in which all the members are induced paths having same parity

Induced label graphoidal graphs

Abstract. Let G be a non-trivial, simple, finite, connected and undirected graph of order n and size m

RESEARCH ON NUMBER THEORY AND SMARANDACHE NOTIONS

This Book is devoted to the proceedings of the fifth International Conference on Number Theory and Smarandache Notions held in Shangluo during March 27-30, 2009, assembling not only those papers which were presented at the conference but also those papers which were submitted later and are concerned with the Smarandache type problems or other mathematical problems.PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON NUMBER THEORY AND SMARANDACHE NOTION

International Journal of Mathematical Combinatorics, Vol.3

The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx. per volume, which publishes original research papers and survey articles in all aspects of Smarandache multi-spaces, Smarandache geometries, mathematical combinatorics, non-euclidean geometry and topology and their applications to other sciences