Hybrid bases in graphs
Novak, L.A. and Gibbons, A.M. (1992) Hybrid bases in graphs. Technical Report. Department of Computer Science, Coventry, UK.
|PDF - Published Version |
Download (1884Kb) | Preview
In this paper we introduce a new concept, that of hybrid base, which is a maximal circuitless and cutsetless subset of a graph. Although this concept of simultaneous circuitlessness and cutsetlessness has been used in proofs of some theorems in so called hybrid graph theory, it has not received much attention. Only largest circuitless and cutsetless subsets (hybrid bases of maximum cardinality) have been recognised as important and then only as an auxiliary notion. In contrast to maximally circuitless subsets (trees) or to maximally cutsetless subsets (cotrees), hybrid bases are not of the same cardinality. This fact, although seemingly an "imperfection is the cause of rich structure which we describe in this paper through several propositions. The concept of hybrid bases is related to several important notions in hybrid orientated graph theory. For example, it is related to maximally distant pairs of trees, to complementary pairs of trees, to perfect trees and to topological degree of freedom. It is also closely related to the problem of finding the minimum number of independent variables in the hybrid analysis of electrical networks.
|Item Type:||Monograph (Technical Report)|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Divisions:||Faculty of Science > Computer Science|
|Depositing User:||Mr Ebrahim Ardeshir|
|Date Deposited:||18 Dec 2011 14:37|
|Last Modified:||01 Nov 2012 18:06|
Actions (login required)