2014
DOI: 10.5120/17363-7882
|View full text |Cite
|
Sign up to set email alerts
|

Enumeration of Basic Hamilton Cycles in the Mangoldt Graph

Abstract: The Mangoldt graph M n is an arithmetic function, namely, Mangoldt function (n), n ≥ 1 an integer. In this paper the notion of a basic Hamilton cycles in M n is introduced and their number is enumerated.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2015
2015

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…For each there exist several even free graphs .These graphs are motivated from Mangoldt graphs [8].Now we study the structure and several properties of these even free graphs.…”
Section: The Structure and Properties Of The Even Free Graphmentioning
confidence: 99%
“…For each there exist several even free graphs .These graphs are motivated from Mangoldt graphs [8].Now we study the structure and several properties of these even free graphs.…”
Section: The Structure and Properties Of The Even Free Graphmentioning
confidence: 99%