scientific article; zbMATH DE number 1232919

Publication date: 15 December 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Graph theory (05Cxx) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to combinatorics (05-00)

Related Items (95)

On self-clique shoal graphs ⋮ A note on the Nordhaus-Gaddum type inequality to the second largest eigenvalue of a graph ⋮ Is the list of incomplete open cubes complete? ⋮ Clique-partitioned graphs ⋮ Matching preclusion for vertex-transitive networks ⋮ Constructing integer-magic graphs via the Combinatorial Nullstellensatz ⋮ Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density ⋮ Nordhaus-Gaddum problems for power domination ⋮ Cyclic bi‐embeddings of Steiner triple systems on 12s + 7 points ⋮ Some results on the total proper \(k\)-connection number ⋮ New inequalities for network distance measures by using graph spectra ⋮ Toric geometry of cuts and splits ⋮ Computation of new diagonal graph Ramsey numbers ⋮ Some results on the 3-total-rainbow index ⋮ Maximum generic nullity of a graph ⋮ On graphic elementary lifts of graphic matroids ⋮ Degree-based entropies of networks revisited ⋮ On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability ⋮ The spectrum problem for digraphs of order 4 and size 5 ⋮ Face 2-Colorable Embeddings with Faces of Specified Lengths ⋮ Generating effective symmetry-breaking predicates for search problems ⋮ Towards objective measures of algorithm performance across instance space ⋮ Möbius regular maps ⋮ Ordered multiplicity inverse eigenvalue problem for graphs on six vertices ⋮ Homogeneous factorisations of complete multipartite graphs ⋮ Unnamed Item ⋮ Connective Steiner 3-eccentricity index and network similarity measure ⋮ Bounds for degree-based network entropies ⋮ On graph entropy measures based on the number of independent sets and matchings ⋮ The strong spectral property for graphs ⋮ Intriguing sets of vertices of regular graphs ⋮ Computing the automorphic chromatic index of certain snarks ⋮ Perfect 2-coloring of the quartic graphs with order at most 8 ⋮ The minimum size of \(k\)-rainbow connected graphs of given order ⋮ A 4-dimensional graph has at least 9 edges ⋮ Intriguing sets of points of \(Q(2n,2)\backslash Q ^{+}(2n - 1,2)\) ⋮ Characterizing graphs of maximum matching width at most 2 ⋮ Examining k-nearest neighbour networks: Superfamily phenomena and inversion ⋮ Exact results on Potts model partition functions in a generalized external field and weighted-set graph colorings ⋮ Exploring the role of graph spectra in graph coloring algorithm performance ⋮ A note on virtual duality and automorphism groups of right-angled Artin groups ⋮ Positive margins and primary decomposition ⋮ On \(\sigma \)-tripartite labelings of odd prisms and even Möbius ladders ⋮ Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited ⋮ Computing inertia sets using atoms ⋮ Graphs associated with vector spaces of even dimension: A link with differential geometry ⋮ Spectral dynamics of guided edge removals and identifying transient amplifiers for death-birth updating ⋮ The principal rank characteristic sequence of a real symmetric matrix ⋮ The liberation set in the inverse eigenvalue problem of a graph ⋮ Vertex-magic labeling of regular graphs: disjoint unions and assemblages ⋮ Automated discovery of angle theorems ⋮ Paving small matrices and the Kadison-Singer extension problem. II: Computational results ⋮ Radial Moore graphs of radius three ⋮ Integer sequence discovery from small graphs ⋮ Subcolorings and the subchromatic number of a graph ⋮ On Euclidean distances and sphere representations ⋮ Radius-edge-invariant and diameter-edge-invariant graphs ⋮ DiscreteZOO: a fingerprint database of discrete objects ⋮ On upper domination Ramsey numbers for graphs. ⋮ Collision probability between sets of random variables. ⋮ Unnamed Item ⋮ On cyclic \(G\)-designs where \(G\) is a cubic tripartite graph ⋮ Folding list of graphs obtained from a given graph ⋮ Network similarity measure and Ediz eccentric connectivity index ⋮ Total domination and total domination subdivision number of a graph and its complement ⋮ Graph distance measures based on topological indices revisited ⋮ Primitive decompositions of Johnson graphs ⋮ A zero forcing technique for bounding sums of eigenvalue multiplicities ⋮ Tetracyclic graphs with extremal values of Randić index ⋮ On the inverse eigenvalue problem for block graphs ⋮ The number of edges, spectral radius and Hamilton-connectedness of graphs ⋮ Zero forcing propagation time on oriented graphs ⋮ Techniques for determining the minimum rank of a small graph ⋮ Dynamic resource location with tropical algebra ⋮ Two rank six geometries for the Higman--Sims sporadic group ⋮ Cycle double covers and spanning minors. II ⋮ A contribution to queens graphs: a substitution method ⋮ Altitude of regular graphs with girth at least five ⋮ Ranking measures for radially Moore graphs ⋮ The spectral radius of edge chromatic critical graphs ⋮ Alpha graphs with different pendent paths ⋮ The spectrum problem for the connected cubic graphs of order 10 ⋮ Representing graphs in Steiner triple systems ⋮ On the Roots of σ-Polynomials ⋮ Some relations between rank, chromatic number and energy of graphs ⋮ Unnamed Item ⋮ From Graph Orientation to the Unweighted Maximum Cut ⋮ On decomposing the complete symmetric digraph into orientations of \(K_4 - e\) ⋮ Algebraic geometry of Gaussian Bayesian networks ⋮ Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that ⋮ Vertex-magic labelings of regular graphs. II. ⋮ Pair production of the vectorlike top partner at future muon collider ⋮ Single production of vectorlike \(B\) quarks decaying into \(bh\) at the CLIC ⋮ Toward a Laplacian spectral determination of signed ∞-graphs ⋮ On independent doubly chorded cycles

Uses Software

nauty

This page was built for publication: