scientific article; zbMATH DE number 3226832

zbMath0139.41503MaRDI QIDQ5515142

Robert Z. Norman, Dorwin Cartwright, Frank Harary

Publication date: 1965

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

zbMATH Keywords

topology

Related Items

On kernel-perfect critical digraphs, Nested \(\epsilon\)-decompositions and clustering of complex systems, Even cycles in directed graphs, The graph model for conflicts, The competition-common enemy graph of a digraph, Signed Roman \(k\)-domination in digraphs, Note on eccentricities in tournaments, Clique polynomials have a unique root of smallest modulus, The principal partition of a pair of graphs and its applications, Graph theoretic foundations of pathfinder networks, Graphical partially ordered sets, Social balance on networks: the dynamics of friendship and enmity, Short cycle connectivity, Some structural results concerning certain classes of qualitative matrices and their inverses, Reachability matrix by partitioning and related Boolean results, The hierarchical control of ST-finite-state machines, Characterization of signed line digraphs, Characterization of common-edge sigraph, Degree switching operations in networks and large scale systems assignment problems, Digraphs with real and Gaussian spectra, Sign solvable graphs, Structural aspects of controllability and observability. II: Digraph decomposition, On a cycle finding algorithm, Graph theoretic models, Regular separable graphs of minimum order with given diameter, Line digraphs and the Moore-Penrose inverse, A note on the eigenvalue consistency index, Irreducibility of associated matrices, On decentralized stabilization and structure of linear large scale systems, Strict Nash networks and partner heterogeneity, Signed graphs, Every vertex a king, Initial value adjusting method and graph theoretical analysis for the solution of nonlinear multipoint boundary value problems with varying system dimensions, Extensions of graph inversion to support an artificially intelligent modeling environment, The median procedure in cluster analysis and social choice theory, A factorization procedure for finite algebras, The complexity of social groups and social systems described by graph structures, Combined stress and human performance: A weighted digraph model, Enumerating the cycles of a digraph: a new preprocessing strategy, Modelling the reliability of paired comparisons, Maximum number of fixed points in regulatory Boolean networks, Robust economic models, Information processing in complex networks: Graph entropy and information functionals, Tie-breaking semantics and structural totality, Odd properly colored cycles in edge-colored graphs, On mark sequences in 2-digraphs, Evolutionary potential games on lattices, A Bayesian approach to paired comparison rankings based on a graphical model, The logical representation of extensive games, \(p\)-competition numbers, On enumerating paths of K arcs in unoriented complete graphs, Clique detection in directed graphs: A new algorithm, Connective stability of competitive equilibrium, Genetic drift in exogamous marriage systems, When is a complex ecosystem stable, Some applications of graph theory to clustering, Large-scale systems: Stability, complexity, reliability, Speicheroptimale Formelübersetzung, Cellular systems. I: Stability of chemical systems, Développements recents de la théorie des graphes, Acyclic orientations of a graph and the chromatic and independence numbers, Computational experiences with some transitive closure algorithms, Identification of simultaneous equation models with measurement error, Convex polyhedra of doubly stochastic matrices. IV, Matrix operations and the properties of networks and directed graphs, Structural similarity of directed universal hierarchical graphs: a low computational complexity approach, Structural identification of large systems by reduction to subsystems: VLDL triglycerides, Characterization of self-complementary graphs with 2-factors, Realization of dependency structures, Characterization of signed graphs whose iterated signed line graphs are balanced or \(S\)-consistent, Constructing blockmodels: how and why, Optimum domination in weighted trees, Studies on the balancing, the minimal balancing, and the minimum balancing processes for social groups with planar and nonplanar graph structures, Ultrametrics and matrix theory, Consistency in marked digraphs, Revisiting the theory of stability of stationary linear large-scale systems, Solution of the Hamiltonian problem for self-complementary graphs, Probabilities of homomorphic mappings from multiple graphs, A graph-theoretic perspective on the links-to-concepts ratio expected in cognitive maps, Structurally fixed modes: Decomposition and reachability, Phylogeny numbers, Path lengths and initial derivatives in arbitrary and Hessenberg compartmental systems, Vertex- and edge-minimal and locally minimal graphs, On the out-domination and in-domination numbers of a digraph, A sharp nonconvexity bound for partition ranges of vector measures with atoms, The optimum assignments and a new heuristic approach for the traveling salesman problem, A graph-theoretic characterization of structurally fixed modes, Structure analyses for large scale nonlinear multipoint boundary value problems, On two classes of matrices with positive diagonal solutions to the Lyapunov equation, Dimensions of election procedures: Analyses and comparisons, A characterization of competition graphs, A characterization of graphs of competition number m, Signsolvability revisited, An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs, Spectral multiplicity and splitting results for a class of qualitative matrices, Sensitivity analysis of an agricultural linear programming model, Some results concerning invertible Morishima and anti-Morishima matrices whose associated digraphs are trees, A theorem concerning certain sign symmetric matrices whose inverses are Morishima, The square of a chordal graph, Parallel concepts in graph theory, On the point-group and line-group of a graph, Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices, Unnamed Item, Pole assignment problem: a structural investigation, Multi-level Access Control, Directed Graphs and Partial Orders in Flow Control for Data Secrecy and Privacy, A Dynamic Programming Algorithm To Test A Signed Graph For Balance, Minimally strong digraphs, Distance in graphs, An Application of Arc-Reaching Sets in Social-Network Analysis, Unnamed Item, Enumeration of Mixed Graphs, Mathematical Sociology: Some Educational and Organizational Problems of an Emergent Sub‐Discipline, The watchman's walk problem on directed graphs, Unnamed Item, Unnamed Item, Total double Roman domination numbers in digraphs, PFFM and Quasi-Morishima matrices, Clearing payments in dynamic financial networks, A Very General Theorem on Systems of Distinct Representatives, Mining ℰℒ⊥ Bases with Adaptable Role Depth, Graph-based representation of history-dependent material response in the data-driven computational mechanics framework, SELECT PROPERTIES OF THE GRAPH MODEL OF A GENERAL AUTOMATON, Unnamed Item, Characterizations of graphs having orientations satisfying local degree restrictions, Grafi e strutture algebriche, Bicolored digraph grammar systems, Generalized quantification as substructural logic, Unnamed Item, A brief history of balance through time, ON THE DICHROMATIC INDEX OF A DIGRAPH, Structurally fixed modes or systems described by Rosenbrock's polynomial matrices, Ordered pairs of arcs and demiarcs†, THE HEIDER BALANCE: A CONTINUOUS APPROACH, On fuzzy cliques in fuzzy networks, Hybrid Petri net and digraph approach for deadlock prevention in automated manufacturing systems, Unnamed Item, Connected reorientations of mixed multigraphs, Unnamed Item, On signed digraphs with all cycles negative, On reachability of dynamic systems†, A sufficient condition for a matrix to be totally unimodular, A distance model for sociometric structure†, On pure structure of dynamic systems, A general model for automated business diagnosis, ANALYSIS OF A GENERAL LOGICAL DISCOURSE FOR MAN‐MACHINE INTERACTION—PART II, On the duality for large-scale systems†, A graph theoretic approach to the investigation of system‐environment relationships†, A newa priori ordering method for sparse systems of equations based on an ordered output set, Competitive processes—I. stability of hereditary systems, A sector approach to the: formulation of system dynamics models, Enumeration of graphs with signed points and lines, Random directed graph distributions and the triad census in social networks†, On independent circuits of a digraph, Graph theory, A general social dilemma: Profitable exchange and intransitive group preferences, Randomly Eulerian digraphs, The Role of Structural Reasoning in the Genesis of Graph Theory, Decomposition for augmented forms of large-scale systems, The graphs for which all strong orientations are hamiltonian, Who should be my friends? Social balance from the perspective of game theory, Spectral criterion for cycle balance in networks, On the Number of Nonzeros Added when Gaussian Elimination is Performed on Sparse Random Matrices, Edge Sums Of De Bruijn Interconnection Networks, Restructured class of estimators for population mean using an auxiliary variable under simple random sampling scheme, Degree frequencies in digraphs and tournaments, Condition for a tournament score sequence to be simple, The number of reachable pairs in a digraph, Matrix measures for transitivity and balance*, Cycles in digraphs– a survey, Input- and output-decoupling structural zeros of linear systems described by Rosenbrock's polynomial matrices, Unnamed Item, Total domination in digraphs, Signal flow graph reduction of sampled-data systems, Optimum feedback patterns in multivariable control systems, Partitions and homomorphisms in directed and undirected graphs, A Representation of bipartite graphs by digraphs and its programming application, DIRECTED GRAPH THEORY AND THE ECONOMIC ANALYSIS OF INNOVATION, Vulnerability of dynamic systems†, Distributional Aspects of Some Statistics in Weighted Social Networks, On the Computation of the Competition Number of a Graph, Universal Logic as a Science of Patterns, Enumeration of self‐converse digraphs, On signed graphs with two distinct eigenvalues, On the number of balanced signed graphs, Partition signed social networks via clustering dynamics, Inverting Signed Graphs, Data flow analysis from capability lists, with application to RBAC, Towards the Heider balance with a cellular automaton, Bounds on the signed Roman \(k\)-domination number of a digraph, Analyzing cognitive maps to help structure issues or problems, The importance of eliciting stakeholders' system boundary perceptions for problem structuring and decision-making, On digraphs with the odd cycle property, Algebraic structures for dynamic networks, Projection matrices revisited: a potential-growth indicator and the merit of indication, Negative (and positive) circles in signed graphs: a problem collection, Structural properties of large-scale systems possessing similar structures, Model structure, complexity, and algorithmic transparency in APL, Games, graphs and Kirchhoff laws, Controllability of linear single-input positive discrete-time systems, A graph theoretic approach to similarity relations, Subpath acyclic digraphs, Detecting stable matrices, Sensitivity analysis of linear systems—a structural approach, Mathematical frameworks for phenotypical selection and epistasis, Differential inequalities in multi-agent coordination and opinion dynamics modeling, Graph theoretic structure of the matrix inverse relating to large-scale systems, On the spectral radius of the generalized adjacency matrix of a digraph, The circumplex: a slightly stronger than ordinal approach., Correction to: ``Restructured class of estimators for population mean using an auxiliary variable under simple random sampling scheme. A remark on normalized Laplacian eigenvalues of signed graph, Enumeration of labelled chain graphs and labelled essential directed acyclic graphs., Generating functions of some families of directed uniform hypergraphs, Perfect graphs, kernels, and cores of cooperative games, Cognitive mapping expert views for policy analysis in the public sector., Reachability matrix and relation to large-scale systems, A formal theory of social power, Modeling resource flow asymmetries using condensation networks, Computational study on a PTAS for planar dominating set problem, Unnamed Item, Signed intersection graphs, The solution of generalized stable sets and its refinement, A remark on eigen values of signed graph, Prediction of socio-economical consequences of privatization at the firm level with fuzzy cognitive mapping, A faster algorithm for betweenness centrality*, A note on the characterization of Nash networks, Rectangular Matrices and Signed Graphs, On the sum of all distances in a graph or digraph, Stronger-than-Lyapunov notions of matrix stability, or how ``flowers help solve problems in mathematical ecology, Double Roman domination in digraphs, Inversion of \(e\)-simple block matrices, Causality and consistency in economic models, Score sequences of oriented graphs, Graceful signed graphs: II. The case of signed cycles with connected negative sections, Signed bounded confidence models for opinion dynamics, Nonnegative matrices as a tool to model population dynamics: Classical models and contemporary expansions, Opinion Dynamics and the Evolution of Social Power in Influence Networks, The number of paths and cycles in a digraph, On the problem of reconstructing a tournament from subtournaments, Some properties of cycle-free directed graphs and the identification of the longest path, The centrality index of a graph, On the linegraph of a directed-graph, Bestimmung minimaler Wege in endlichen, gerichteten, bewerteten Graphen, Blockmodels with maximum concentration., Attribute hierarchy models in cognitive diagnosis: identifiability of the latent attribute space and conditions for completeness of the Q-matrix, Convexity in directed graphs, Special parity of perfect matchings in bipartite graphs, A note on a matrix criterion for unique colorability of a signed graph, Boolean monomial control systems, On nontransitive indifference, Balance Theory with Incomplete Awareness, System identification based on point processes and correlation densities. I: The nonrefractory neuron model, Zum Auswahlproblem, Über die X-Summe von gerichteten Graphen, The theorem on the decomposition of Finsler numbers in prime factors, Arc colorings of digraphs, A man-machine interface for computer-aided design and simulation of control systems, A derivation of a measure of relative balance for social structures and a characterization of extensive ratio systems, Height on posets and graphs, A graph polynomial and its applications, Phylogeny numbers for graphs with two triangles, Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi, Min and max hierarchical clustering using asymmetric similarity measures, \({\mathfrak R}\)-Netzwerke und Matrixalgorithmen, Compartmental matrices with single root and nonnegative nilpotent matrices, Zwei Verfahren zur Suche negativer Zyklen in bewerteten Digraphen, Alarm placement in systems with fault propagation, Bypasses in asymmetric digraphs, Determining connectedness from subdigraphs, An improved transitive closure algorithm, The dichromatic number of a digraph, Conditional connectivity, Packing and domination parameters in digraphs, Achievement and avoidance games designed from theorems, Combinatorial properties of binary semigroups, Geodetic orientations of complete \(k\)-partite graphs, The occurrence of finite groups in the automorphism group of nilpotent groups of class 2, Probability and logic in belief systems, Emergence of Balance from a Model of Social Dynamics, Where is this leading me: stationary point and equilibrium analysis for self-modeling network models, \(B_i\) and branching strict Nash networks in two-way flow models: a generalized sufficient condition, Irreducible economies and strongly connected graphs, A pretopological approach for structural analysis, A new graph characteristic and its application to numerical computability, The theory of combined-arms lanchester-type models of warfare, Stock selection heuristics for interdependent items