scientific article; zbMATH DE number 3503313
From MaRDI portal
Publication:4083484
zbMath0322.05144MaRDI QIDQ4083484
Bussemaker, Frans C., S. Cobeljic, J. J. Seidel, Dragos Cvetković
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (30)
On the edge forwarding index problem for small graphs ⋮ Cycles containing 12 vertices in 3-connected cubic graphs ⋮ Extremal cubic graphs for fault-tolerant locating domination ⋮ Johan Jacob Seidel ⋮ Computer observations of cycles in cubic graphs ⋮ The structure of trivalent graphs with minimal eigenvalue gap ⋮ Unrooted non-binary tree-based phylogenetic networks ⋮ Constructing cospectral graphs ⋮ Cycle-saturated graphs of minimum size ⋮ Fault-tolerant detectors for distinguishing sets in cubic graphs ⋮ Digraphs with real and Gaussian spectra ⋮ On certain regular nicely distance-balanced graphs ⋮ Quartic graphs with minimum spectral gap ⋮ Parastrophically uncancellable quasigroup equations ⋮ Partially balanced incomplete block (PBIB)-designs associated with geodetic sets in graphs ⋮ Progress on fault-tolerant locating-dominating sets ⋮ Automated discovery of angle theorems ⋮ Note sur la non existence d'un snark d'ordre 16 ⋮ Perfect 2-colorings of the cubic graphs of order less than or equal to 10 ⋮ An 11-vertex theorem for 3-connected cubic graphs ⋮ Clique-inserted-graphs and spectral dynamics of clique-inserting ⋮ On the divisibility of the cycle number by 7 ⋮ Distance degree regular graphs and distance degree injective graphs: an overview ⋮ Cycles through five edges in 3-connected cubic graphs ⋮ On extendability of co-edge-regular graphs ⋮ Regular graphs with minimum spectral gap ⋮ Close-to-zero eigenvalues of the rooted product of graphs ⋮ Cycles through four edges in 3-connected cubic graphs ⋮ Perfect 3-colorings of the cubic graphs of order 10 ⋮ The expected number of pairs of connected nodes: Pair-connected reliability
This page was built for publication:
