Smallest cubic and quartic graphs with a given number of cutpoints and bridges | Zendy

Gary Chartrand | Zendy; Farrokh Saba | Zendy; John K. Cooper | Zendy; Frank Harary | Zendy; Curtiss E. Wall | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Smallest cubic and quartic graphs with a given number of cutpoints and bridges

Author(s) -

Gary Chartrand,

Farrokh Saba,

John K. Cooper,

Frank Harary,

Curtiss E. Wall

Publication year - 1982

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/s0161171282000052

Subject(s) - algorithm , mathematics , artificial intelligence , computer science

For positive integers b and c, with c even, satisfying the inequalities b+1≤c≤2b, the minimum order of a connected cubic graph with b bridges and c cutpoints is computed. Furthermore, the structure of all such smallest cubic graphs is determined. For each positive integer c, the minimum order of a quartic graph with c cutpoints is calculated. Moreover, the structure and number of all such smallest quartic graphs are determined

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