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