scientific article

zbMath0105.35401MaRDI QIDQ3291034

No author found.

Publication date: 1962

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

zbMATH Keywords

topology

Related Items (only showing first 100 items - show all)

A sufficient condition for oriented graphs to be Hamiltonian ⋮ Bounds on the domination number and the metric dimension of co-normal product of graphs ⋮ The domination number and the least \(Q\)-eigenvalue ⋮ Transferable domination number of graphs ⋮ Improved upper bounds on the domination number of graphs with minimum degree at least five ⋮ Conditions for universal reducibility of a two-stage extremization problem to a one-stage problem ⋮ Edge criticality in graph domination ⋮ The difference between the metric dimension and the determining number of a graph ⋮ Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph ⋮ Domination number in graphs with minimum degree two ⋮ Characterization of diagrams by 0-1 inequalities ⋮ Galois theory for clones and superclones ⋮ Infimal generators and dualities between complete lattices ⋮ Isolation in graphs ⋮ Amenable group actions on infinite graphs ⋮ Double Roman domination ⋮ Optimal broadcast domination in polynomial time ⋮ Minimizing the Laplacian eigenvalues for trees with given domination number ⋮ On the outer-connected domination in graphs ⋮ A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs ⋮ On strong (weak) independent sets and vertex coverings of a graph ⋮ Matroids and linking systems ⋮ Matchings and transversals in hypergraphs, domination and independence in trees ⋮ Critical sets in bipartite graphs ⋮ Normal extensions escape from the class of weighted shifts on directed trees ⋮ The complexity of embedding orders into small products of chains ⋮ Restricted domination in graphs with minimum degree 2 ⋮ Dominating direct products of graphs ⋮ Graphs with disjoint dominating and paired-dominating sets ⋮ Bounds on the \(k\)-dimension of products of special posets ⋮ Rainbow edge-coloring and rainbow domination ⋮ Domination versus independent domination in cubic graphs ⋮ Trees as level sets for pseudoharmonic functions in the plane ⋮ Domination in 4-regular graphs with girth 3 ⋮ ILIGRA: an efficient inverse line graph algorithm ⋮ A note on 3-Steiner intervals and betweenness ⋮ Minimal energies of trees with given parameters ⋮ Domination number and Laplacian eigenvalue distribution ⋮ The decomposition tree of a biconnected graph ⋮ Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack ⋮ Estimations for the domination number of a graph ⋮ Graphs with constant sum of domination and inverse domination numbers ⋮ Some upper bounds related with domination number ⋮ Structural theory of space-time and intrapoint symmetry ⋮ Towards a new framework for domination ⋮ Dominating and total dominating partitions in cubic graphs ⋮ Domination number of graphs without small cycles ⋮ Dominator colorings in some classes of graphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ On extremal Zagreb indices of trees with given domination number ⋮ Permanental bounds of the Laplacian matrix of trees with given domination number ⋮ Facet defining inequalities among graph invariants: The system graphedron ⋮ A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets ⋮ Characterizing minimal point set dominating sets ⋮ Partially normal composition operators relevant to weighted directed trees ⋮ On the domination number of Hamiltonian graphs with minimum degree six ⋮ The \(L(2,1)\)-labeling on Cartesian sum of graphs ⋮ The \(k\)-rainbow reinforcement numbers in graphs ⋮ Diameter bounded equal measure partitions of Ahlfors regular metric measure spaces ⋮ On subgraphs in distance-regular graphs ⋮ A note on graphs which have upper irredundance equal to independence ⋮ Statistical physics of vaccination ⋮ Exact algorithms for minimum weighted dominating induced matching ⋮ Bounds relating generalized domination parameters ⋮ Two strongly polynomial cut cancelling algorithms for minimum cost network flow ⋮ Networks of common property resources ⋮ Extremal energies of trees with a given domination number ⋮ Bounds of Laplacian spectrum of graphs based on the domination number ⋮ Lower bounds on the differential of a graph ⋮ Structural and algorithmic properties for parametric minimum cuts ⋮ Coloring the Cartesian sum of graphs ⋮ Domination in bipartite graphs ⋮ Bipartite toughness and \(k\)-factors in bipartite graphs ⋮ Bounds on weak Roman and 2-rainbow domination numbers ⋮ The minimum genus of a two-point universal graph ⋮ Minimum degree of bipartite graphs and the existence of k-factors ⋮ On the domination number of generalized petersen graphs \(P(n,2)\) ⋮ On the ratios between packing and domination parameters of a graph ⋮ Path lengths and initial derivatives in arbitrary and Hessenberg compartmental systems ⋮ Geodetic blocks of diameter three ⋮ Matching relations and the dimensional structure of social choices ⋮ The minimum spectral radius of graphs with a given independence number ⋮ Domination and location in twin-free digraphs ⋮ A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs ⋮ More on limited packings in graphs ⋮ An Ore-type condition for the existence of two disjoint cycles ⋮ On concrete characterization problem of endomorphism semigroups of graphs ⋮ Modal logics of domains on the real plane ⋮ Representation of functional dependencies in relational databases using linear graphs ⋮ On realizable biorders and the biorder dimension of a relation ⋮ Graph isomorphism problem ⋮ Relations between parameters of a graph ⋮ A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs ⋮ What is the difference between the domination and independent domination numbers of a cubic graph? ⋮ Geodetic graphs of diameter two and some related structures ⋮ Whitney's theorem for infinite graphs ⋮ Conjugaison par tranches ⋮ Some properties of commutation in free partially commutative monoids ⋮ A Chvátal-Erdős condition for (1,1)-factors in digraphs ⋮ Point algebras for temporal reasoning: Algorithms and complexity

This page was built for publication: