scientific article; zbMATH DE number 1179517
From MaRDI portal
Publication:4398864
zbMath0902.05016MaRDI QIDQ4398864
Publication date: 28 July 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Minimum strictly fundamental cycle bases of planar graphs are hard to find ⋮ Minimum degree distance among cacti with perfect matchings ⋮ The clique number and the smallest \(Q\)-eigenvalue of graphs ⋮ On the Zarankiewicz problem for intersection hypergraphs ⋮ Polynomial invariants for arbitrary rank \(D\) weakly-colored stranded graphs ⋮ On the dynamics of a class of multi-group models for vector-borne diseases ⋮ On the extreme eccentric distance sum of graphs with some given parameters ⋮ On the uniqueness of some girth eight algebraically defined graphs ⋮ Computing the Tutte polynomial of Archimedean tilings ⋮ Noise-stability and central limit theorems for effective resistance of random electric networks ⋮ On the general sum-connectivity index of tricyclic graphs ⋮ Tutte polynomials for benzenoid systems with one branched hexagon ⋮ Tutte polynomial of scale-free networks ⋮ Entropy and stability of phase synchronisation of oscillators on networks ⋮ A lower bound on the expected optimal value of certain random linear programs and application to shortest paths in directed acyclic graphs and reliability ⋮ All Ramsey numbers for brooms in graphs ⋮ On constructing rational spanning tree edge densities ⋮ Diagonalization of generalized lollipop graphs ⋮ Generalized Ramsey numbers through adiabatic quantum optimization ⋮ Exact and approximate algorithms for movement problems on (special classes of) graphs ⋮ Edge-transitivity of Cayley graphs generated by transpositions ⋮ Some extremal properties of the resolvent energy, Estrada and resolvent Estrada indices of graphs ⋮ Decomposing highly edge-connected graphs into paths of any given length ⋮ Proof of a conjecture on monomial graphs ⋮ Extremal results for random discrete structures ⋮ Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction ⋮ Cluster synchronization analysis of complex dynamical networks by input-to-state stability ⋮ Bounds on the 2-rainbow domination number of graphs ⋮ Computing hypergraph Ramsey numbers by using quantum circuit ⋮ Minoration of the complexity function associated to a translation on the torus ⋮ Pfaffian graphs embedding on the torus ⋮ On compatibility of discrete full conditional distributions: a graphical representation approach ⋮ Vanishing ideals over complete multipartite graphs ⋮ The complexity of weighted counting for acyclic conjunctive queries ⋮ On the Turán number of forests ⋮ Embedding cycles in finite planes ⋮ The adjacency matroid of a graph ⋮ Shattering, graph orientations, and connectivity ⋮ A port-Hamiltonian approach to power network modeling and analysis ⋮ Total rainbow \(k\)-connection in graphs ⋮ On the spectrum of Wenger graphs ⋮ Abelian quiver invariants and marginal wall-crossing. ⋮ Some extremal problems for hereditary properties of graphs ⋮ Extremal problems for the \(p\)-spectral radius of graphs ⋮ Finite groups whose prime graphs are regular. ⋮ The average reliability of a graph ⋮ Rental harmony with roommates ⋮ Perfect matchings in 3-partite 3-uniform hypergraphs ⋮ On hyper-Kirchhoff index ⋮ Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number ⋮ On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges ⋮ On extremal hypergraphs for Hamiltonian cycles ⋮ Sparse reliable graph backbones ⋮ Forbidding and enforcing on graphs ⋮ On plane graphs with link component number equal to the nullity ⋮ On rainbow-\(k\)-connectivity of random graphs ⋮ Monomial graphs and generalized quadrangles ⋮ Conical and spherical graphs ⋮ The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs ⋮ Estimation of means in graphical Gaussian models with symmetries ⋮ Testing connectivity of faulty networks in sublinear time ⋮ The number of independent sets of tricyclic graphs ⋮ Cycles in projective spaces ⋮ The structure and metric dimension of the power graph of a finite group ⋮ Graph homomorphisms between trees ⋮ Spectral bounds for the independence ratio and the chromatic number of an operator ⋮ Extremal unicyclic graphs with minimal distance spectral radius ⋮ Equal distribution of satellite constellations on circular target orbits ⋮ On coloring box graphs ⋮ Potential distribution on random electrical networks ⋮ MAX-plus objects to study the complexity of graphs ⋮ Dynamics and kinetic limit for a system of noiseless \(d\)-dimensional Vicsek-type particles ⋮ Binary matroids and local complementation ⋮ Judicious partitions of uniform hypergraphs ⋮ Regularity and algebraic properties of certain lattice ideals ⋮ New classes of extremal graphs with given bandwidth ⋮ Zeros of Jones polynomials of graphs ⋮ Spanning forests in regular planar maps ⋮ Characterizations of Mersenne and 2-rooted primes ⋮ Extrema of graph eigenvalues ⋮ NLS ground states on graphs ⋮ Groups that are transitive on all partitions of a given shape ⋮ The equitable vertex arboricity of complete tripartite graphs ⋮ On minimum reload cost cycle cover ⋮ Notes on ``Bipolar fuzzy graphs ⋮ Topological chirality of a type of DNA and protein polyhedral links ⋮ Bollobás-Riordan and relative Tutte polynomials ⋮ Complex and detailed balancing of chemical reaction networks revisited ⋮ Counting polynomials with distinct zeros in finite fields ⋮ Cacti with maximum eccentricity resistance-distance sum ⋮ The influence of the complete nonexterior square graph on some infinite groups ⋮ Hydras: complexity on general graphs and a subclass of trees ⋮ Necessary and sufficient conditions for consensus in nonlinear monotone networks with unilateral interactions ⋮ Rainbow matchings and rainbow connectedness ⋮ Rainbow Turán problems for paths and forests of stars ⋮ On the distribution of the domination number for random class cover catch digraphs ⋮ Matroid invariants and counting graph homomorphisms ⋮ Annihilators in zero-divisor graphs of semilattices and reduced commutative semigroups ⋮ A dichotomy for real weighted Holant problems ⋮ Bifurcation without parameters in circuits with memristors: a DAE approach
This page was built for publication:
