|
|
|
|
Complexity of products of some complete and complete bipartite graphs
|
|
|
|
|
|
|
|
نویسنده
|
daoud s.n.
|
|
منبع
|
journal of applied mathematics - 2013 - دوره : 2013 - شماره : 0
|
|
چکیده
|
The number of spanning trees in graphs (networks) is an important invariant; it is also an important measure of reliability of a network. in this paper,we derive simple formulas of the complexity,number of spanning trees,of products of some complete and complete bipartite graphs such as cartesian product,normal product,composition product,tensor product,and symmetric product,using linear algebra and matrix analysis techniques. © 2013 s. n. daoud.
|
|
|
|
|
آدرس
|
department of mathematics,faculty of science,taibah university,al madinah 344,saudi arabia,department of mathematics,faculty of science,el-menoufia university, Egypt
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|