scientific article

Publication date: 1962

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

Related Items

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, On the Algorithmic Complexity of Total Domination, Structure indicators for transportation graph analysis. I: Planar connected simple graphs, What is relative measurement! The ratio scale phantom, The index of primitivity of a non-negative matrix, Graph-theoretic and algebraic characterizations of some Markov processes, Isolation of $k$-cliques. II, Domination in fuzzy incidence graphs based on valid edges, Some advances on the set covering polyhedron of circulant matrices, Designs associated with maximum independent sets of a graph, A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, A graph-theoretic algorithm for the solution of a linear diophantine problem of Frobenius, On a linear diophantine problem of Frobenius: an improved algorithm, A polynomial-time approximation to a minimum dominating set in a graph, Controllability and the theory of economic policy: a structural approach, On dominating set polyhedra of circular interval graphs, Self-consistency, consistency and cycles in non-partitional knowledge models, THE IRREDUNDANT RAMSEY NUMBER s(3,6), Which graphs occur as $\gamma$-graphs?, On $\alpha$-excellent graphs, Approximability results for the converse connectedp-centre problem^†, Domination on hyperbolic graphs, König's Infinity Lemma and Beth's Tree Theorem, Disjunctive total domination in permutation graphs, Detailed balance $=$ complex balance $+$ cycle balance: a graph-theoretic proof for reaction networks and Markov chains, Extremal graphs for a new upper bound on domination parameters in graphs, Unimodular modules, Analysis of the load distribution and internodal flows under different routing strategies in a multiuser network, Estimate of resource distribution with the shortest paths in the multiuser network, LUNE-FREE KNOT GRAPHS, PBIB-designs and association schemes arising from minimum bi-connected dominating sets of hypercubes, A decomposition approach for solving a broadcast domination network design problem, A tight upper bound for 2-rainbow domination in generalized Petersen graphs, A note on the independent domination number in graphs, Sufficient conditions for unique stable sets in three agent pillage games, On a matrix-based measure of the degree of coreness of a node in a network, Entropy of hard square lattice gas with k distinct species of particles: coloring problems and vertex models, The zoo of tree spanner problems, Small $k$-pyramids and the complexity of determining $k$, An algorithm for obtaining the chromatic number and an optimal coloring of a graph, Deterministic graphical games, On graph fall-coloring: existence and constructions, Generating formulas for the number of trees in a graph, Applying graph theory to some problems of economic dynamics, Random matrices and graphs, The relation between the discard and regularity conditions for choice probabilities, The trunk in the topology of electrical networks, Equi independent equitable dominating sets in graphs, Some properties of cycle-free directed graphs and the identification of the longest path, On the class of Sylow tower groups, On the linegraph of a directed-graph, Graphical formulation of recoupling for any compact group, Bestimmung minimaler Wege in endlichen, gerichteten, bewerteten Graphen, Algebraic reduction of electrical multiterminal networks, Maximum internally stable sets of a graph, The connectivity of line-graphs, Perfect matchings of a graph, On the degrees of the vertices of a directed graph, An extremal problem in graph theory, A technique for the dismounting of a graph, A new algorithm for the solution of the secondary optimization problem in non-serial dynamic programming, Efficient $( t , r )$ broadcast dominating sets of the triangular lattice, Contribution to nonserial dynamic programming, The Königsberg bridges problem generalized, Disorienting patterns of motion, On the power sequence of a graph, Optimum flows in general communication networks, Partially ordered sets and their comparability graphs, On the Redfield-Read combinatory algorithm, A recurrence formula related to the contractions of a graph, Un metodo euristico per la verifica dell'isomorfismo di due grafi semplici non orientati. (A heuristic method for determinating the isomorphism of two simple non-oriented graphs), m-ary closed sequences, On bases of the set of graphs with given coefficient of internal stability, On factorable degree sequences, On edge but not vertex transitive regular graphs, An optimal problem in graph theory, An $n^ 2$ algorithm for determining the bridges of a graph, On fully indecomposable matrices, On the theory of the elimination process, Ergodic properties of populations. I: The one sex model, On the graph for which there is a tree as the inverse interchange graph of a local graph, Bemerkungen zur Ulam-Vermutung, Intersection theorems for systems of sets, Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi, Bestimmung eines maximalen Matching in beliebigen Graphen, On the modularity of a matrix, Strategy construction using homomorphisms between games, Normalformen planarer Graphen. II, A characterization of separating distinguished collections containing the maximum number of sets, Graphs and finite transformation semigroups, ${\mathfrak R}$-Netzwerke und Matrixalgorithmen, Generalization of a kernel of a graph, On covering a product of sets with products of their subsets, Determination of the number of single-valued mappings containing a given equivalence, Applying the minimax rule over graphs which are not trees, On the $k$-domination number of digraphs, Quantiles of multi-sample smirnov type statistics, A backtracking algorithm to generate all kernels of a directed graph, Independent domination of graphs with bounded maximum degree, Estimate of the first eigenvalue of the Laplacian on a graph, RELATIONSHIP BETWEEN BLOCK DOMINATION PARAMETERS OF A GRAPH, The independent domination numbers of strong product of two cycles, Complexity and performance of a graph theory algorithm for cluster analysis†, On topological spaces associated with digraphs, Domination topological indices and their polynomials of a firefly graph, ON 2-POINT-SET DOMINATING SETS, Construction of Halin graph with perfect k-ary tree and its independent domination number, On independent domination parameters of some special families of Halin graph, Die graphentheoretische Lösung eines nichtlinearen Zuteilungsproblems, ISOLATE SEMITOTAL DOMINATION IN GRAPHS, The applicability matrix of a syntax-directed parsing processor, Generation of linear cyclic binary arrays†, Further Algebraic Results in the Theory of Balance, Resolving Roman domination in graphs, On the domination number of a graph and its block graph, Unnamed Item, Equality co-neighborhood domination in graphs, INVERSE DOMINATION AND INVERSE TOTAL DOMINATION FOR AN UNDIRECTED GRAPH, INVERSE DOMINATION NUMBER OF CIRCULANT GRAPH, 2-RESERVED DOMINATION NUMBER OF GRAPHS, DOMINATION AND DOMATIC NUMBERS OF INVOLUTORY CAYLEY GRAPH, ON WEAK DOMINATION NUMBER OF SOME GRAPHS, SOME RESULTS ON WEAK DOMINATION IN GRAPHS, Full patterns in truncated transportation polytopes, Unnamed Item, ?-Perfect graphs, Die asymptotische Verteilung von mehrfachen Koinzidenzen, Flowchart machines, Notes on Latin square graphs and their domination numbers, Unnamed Item, The watchman's walk problem on directed graphs, Some mathematical aspects of the medical diagnostic process. I: a general mathematical model, On Minimal Separating Collections, Mathematical Applications in Sociology: Measurement and Relations, Some results in graph theory and their application to abstract relational biology, Prüfung endlicher homogener Markoffketten auf Ergodizität, Nil properties for rings which are sums of their additive subgroups, Some problems in discrete optimization, A Simple Criterion for a Graph to have a Perfect Matching, Decomposition of bipartite multigraphs into matchings, Domination in Kn\"odel Graphs, Approximability results for the $p$-centdian and the converse centdian problems, On independent domination of regular graphs, On domination in signed graphs, A Note on Isolate Domination Number of a Cubic Graph, The number of cut vertices and cut arcs in a strong directed graph, Partially balanced incomplete block (PBIB)-designs arising from diametral paths in some strongly regular graphs, SELECT PROPERTIES OF THE GRAPH MODEL OF A GENERAL AUTOMATON, Unnamed Item, Unnamed Item, Projects in (t, r) Broadcast Domination, Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network, Unnamed Item, Vertex packings: Structural properties and algorithms, A Simplified Form for Nearly Reducible and Nearly Decomposable Matrices, Graphical-structure-based models for routing problems, The linearization of flow charts, Applications of graph theory in computer systems, Unnamed Item, Short Proof of a Theorem of Rado on Graphs, Configuring Random Graph Models with Fixed Degree Sequences, Unnamed Item, Reduktion von Präzedenzstrukturen, Unnamed Item, Minimum independent dominating energy of graphs, Unnamed Item, Percolation theory on directed graphs, A method for pogram analysis and Its applications to program-correctness problems, Constraint theory: an overview, Matching theorems for combinatorial geometries, On Nonlinear Delay Differential Equations, Unnamed Item, Edge partitions of optimal 2-plane and 3-plane graphs, Decomposition of arborescent linear programs, An algorithm for determining all extreme points of a convex polytope, A linear time implementation of the reverse Cuthill-McKee algorithm, The Role of Structural Reasoning in the Genesis of Graph Theory, Strong vb-dominating and vb-independent sets of a graph, The number of reachable pairs in a digraph, Counting patterns in graphs, OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS, Classification and statistical features of arithmetic graphs, A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs, On the domination number of a graph and its total graph, On domination number of Latin square graphs of finite cyclic groups, Tadpole domination in duplicated graphs, Linear programming formulation for some generalized domination parameters, Determination of a disassembly strategy, Upper whole domination in a graph, A New Characterization of Paired Domination Number of a Graph, Matching, Euler tours and the Chinese postman, Double outer-independent domination number of graphs, Independent domination in signed graphs, On the domination number of a graph and its shadow graph, An Efficient Local Search for the Minimum Independent Dominating Set Problem, Partial ordering of the syntax elements of a language, On some extremal graphs, The minimum vertex–vertex dominating Laplacian energy of a graph, On Congruent Domination Number of Disjoint and One Point Union of Graphs, On the Order of Random Channel Networks, On the revealed preference analysis of stable aggregate matchings, A tight bound for independent domination of cubic graphs without 4‐cycles, Extended formulations for perfect domination problems and their algorithmic implications, A note on bounds for the broadcast domination number of graphs, On connected co-independent domination in the join, corona and lexicographic product of graphs, On k-cost effective domination in the corona and lexicographic product of graphs and its variant, Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem, Self-stabilizing 2-minimal dominating set algorithms based on loop composition, THE FORCING CONVEX DOMINATION NUMBER OF A GRAPH, On unimodular graphs with a unique perfect matching, Partially balanced incomplete block (PBIB)-designs associated with geodetic sets in graphs, Domination in edge cycle graphs, Quantitative analysis of flow distributions in a multiuser telecommunication network, Unnamed Item