Path decompositions of chains and circuits | Zendy

Edward J. Farrell | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Path decompositions of chains and circuits

Author(s) -

Edward J. Farrell

Publication year - 1983

Publication title -

international journal of mathematics and mathematical sciences

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.21

H-Index - 39

eISSN - 1687-0425

pISSN - 0161-1712

DOI - 10.1155/s0161171283000472

Subject(s) - mathematics , path (computing) , disjoint sets , node (physics) , electronic circuit , chain (unit) , topology (electrical circuits) , combinatorics , discrete mathematics , computer science , physics , electrical engineering , structural engineering , astronomy , engineering , programming language

Expressions for the path polynomials (see Farrell [1]) of chains and circuitsare derived. These polynomials are then used to deduce results about node disjoint path decompositions of chains and circuits. Some results are also given for decompositions in which specific paths must be used

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research