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)

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

This page was built for publication: