scientific article

zbMath0097.38903MaRDI QIDQ3277097

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)

An upper bound for the minimum number of queens covering the \(n {\times} n\) chessboard ⋮ An experimental comparison of three heuristics for the WVCP ⋮ Domination parameters for the bishops graph ⋮ Equality in a bound that relates the size and the restrained domination number of a graph ⋮ Edge criticality in graph domination ⋮ On edge semi-isomorphisms and semi-dualities of graphs ⋮ On some counting polynomials in chemistry ⋮ Finite method for a nonlinear allocation problem ⋮ One-node cutsets and the dominating set polytope ⋮ Toroidal tilings from de Bruijn-Good cyclic sequences ⋮ Minimizing the total completion time in a unit-time open shop with release times ⋮ TSP ejection chains ⋮ The adjacency graphs of FSRs with a class of affine characteristic functions ⋮ Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue ⋮ Classes of cycle bases ⋮ Scales and methods for deriving weights in the analytic hierarchy process ⋮ On a class of matrices with real eigenvalues ⋮ Expressions for the perfect matching numbers of cubic \(l\times m\times n\) lattices and their asymptotic values ⋮ De Bruijn sequences, irreducible codes and cyclotomy ⋮ Rainbow edge-coloring and rainbow domination ⋮ Domination versus independent domination in cubic graphs ⋮ On the independent domination number of regular graphs ⋮ On the \({k}\)-power domination of hypergraphs ⋮ The probabilistic minimum dominating set problem ⋮ On vertex independence number of uniform hypergraphs ⋮ Complexity of problems in games, graphs and algebraic equations ⋮ Independent protection in graphs ⋮ The frequency of cyclic processes in biological multistate systems ⋮ The skeleton of an impartial game and the nim-function of Moore's \(\text{Nim}_2\) ⋮ Dijkstra, Floyd and Warshall meet Kleene ⋮ A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs ⋮ Remarks on the requirement matrix of school timetable problems and regular embeddings of graphs ⋮ An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs ⋮ Nonexistence of seven-dimensional tangential 2-blocks ⋮ On the Sprague-Grundy function of \textsc{Exact} \(k\)-\textsc{Nim} ⋮ Contributions to the theory of domination, independence and irredundance in graphs ⋮ Partitioning multi-edge graphs ⋮ Probabilistic inference in multiply connected belief networks using loop cutsets ⋮ On the equality of the partial Grundy and upper ochromatic numbers of graphs ⋮ The cycles approach ⋮ The complexity of social groups and social systems described by graph structures ⋮ Upper bounds on the broadcast function using minimum dominating sets ⋮ On the independent queens covering problem ⋮ Chessboard domination problems ⋮ On the thickness of graphs of given degree ⋮ Cycles in extensive form perfect information games ⋮ Nomadic decompositions of bidirected complete graphs ⋮ Graph-theoretic methods for the analysis of chemical and biochemical networks. I. Multistability and oscillations in ordinary differential equation models ⋮ Domination in 4-regular Knödel graphs ⋮ Online dominating set ⋮ The cardinality of the collection of maximum independent sets of a functional graph ⋮ Total restrained domination in graphs with minimum degree two ⋮ A note on an induced subgraph characterization of domination perfect graphs ⋮ Matching theory -- a sampler: From Dénes König to the present ⋮ Decision problems and regular chain code picture languages ⋮ Two strongly polynomial cut cancelling algorithms for minimum cost network flow ⋮ A relativized measure of circularity for tournaments ⋮ An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree ⋮ Application of complex networks theory in urban traffic network researches ⋮ Energy of double dominating bipolar fuzzy graphs ⋮ Redundant networks and minimum distance ⋮ Vector spaces and the four-color problem ⋮ Infinite digraphs isomorphic with their line digraphs ⋮ Extremal graphs of diameter 4 ⋮ A decomposition algorithm for optimality problems in tree-structured networks ⋮ A note on applying a theorem of Tutte to graphical sequences ⋮ On graphs with a constant link. II ⋮ On sums of graph games with last player losing ⋮ On enumerating paths of K arcs in unoriented complete graphs ⋮ Paths in graphs and minimal \(\pi\)-sequences in semigroups ⋮ Associative products of graphs ⋮ Nonexistence of six-dimensional tangential 2-block ⋮ Simple directed trees ⋮ Words with prescribed adjacencies ⋮ On natural exactly covering systems of congruences having moduli occurring at most twice ⋮ An introduction to matching polynomials ⋮ Connectability and structural controllability of composite systems ⋮ An upper bound for the \(\alpha\)-height of (0,1)-matrices ⋮ The maximum number of \(K_j\)-subgraphs in a graph with \(k\) independent edges ⋮ On the connectivity of clusters ⋮ Constructing blockmodels: how and why ⋮ Mathematical solution for a data processing system ⋮ Upper and lower bounds for graph-diameter problems with application to Record allocation ⋮ Domination-complete graphs ⋮ On the domination number of generalized petersen graphs \(P(n,2)\) ⋮ ``Global graph problems tend to be intractable ⋮ Hereditarily finite sets and identity trees ⋮ A survey of stratified domination in graphs ⋮ A new backtracking algorithm for generating the family of maximal independent sets of a graph ⋮ Application of the algebra of polyrelatives to game theory ⋮ Bounding the trace function of a hypergraph with applications ⋮ Skeletons, shapes, and the shift from surface to structure in architectural geometry ⋮ Generic properties of column-structured matrices ⋮ On large sets of disjoint Steiner triple systems. IV ⋮ Variation on a theorem of König ⋮ The sequence of upper and lower domination, independence and irredundance numbers of a graph ⋮ What is the difference between the domination and independent domination numbers of a cubic graph? ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters ⋮ Relaxed tours and path ejections for the traveling salesman problem ⋮ Games without repetitions on digraphs

This page was built for publication: