Enumeration of independent meshes of an oriented graph

Access Full Text

Enumeration of independent meshes of an oriented graph

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Electrical Engineers
Published

A computer program for the enumeration of independent meshes of an oriented graph is described. The graph can contain any number of separate parts. Any number of meshes may be chosed before the problem is solved.

Inspec keywords: computer-aided circuit analysis; graph theory

Other keywords: oriented graph; enumeration of independent meshes; computer program; graph theory

Subjects: Electronic engineering computing

References

    1. 1)
      • V.V.B. Rao , V.G.K. Murti . Enumeration of all circuits or cutsets of a graph. Electron. Lett. , 104 - 105
    2. 2)
      • S. Madhu . (1992) , Linear circuit analysis.
    3. 3)
      • J. Kollár , K. Lager . Výpočet druhej incidenčnej matice číslicovým počítačom. Elektrotechnický časopis. , 727 - 734
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19710290
Loading

Related content

content/journals/10.1049/el_19710290
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading