Yalgorithmic aspects of decomposition of some graphs
Shodhganga@INFLIBNET
View Archive InfoField | Value | |
Title |
Yalgorithmic aspects of decomposition of some graphs
— |
|
Contributor |
Gnana dhas N
|
|
Subject |
complete tripartite graph
length atleast two proved by induction |
|
Description |
The theorem can be proved by the method of mathematical induction newline — |
|
Date |
2017-05-25T05:27:50Z
2017-05-25T05:27:50Z n.d 2014 n.d |
|
Type |
Ph.D.
|
|
Identifier |
http://hdl.handle.net/10603/151137
|
|
Language |
English
|
|
Relation |
18
|
|
Rights |
university
|
|
Format |
x, 131
— DVD |
|
Coverage |
—
|
|
Publisher |
Tirunelveli
Manonmaniam Sundaranar University Department of Mathematics |
|
Source |
University
|
|