Publication:5515142
From MaRDI portal
zbMath0139.41503MaRDI QIDQ5515142
Frank Harary, Robert Z. Norman, Dorwin Cartwright
Publication date: 1965
Related Items
Input- and output-decoupling structural zeros of linear systems described by Rosenbrock's polynomial matrices, Optimum feedback patterns in multivariable control systems, On the Computation of the Competition Number of a Graph, A Dynamic Programming Algorithm To Test A Signed Graph For Balance, ON THE DICHROMATIC INDEX OF A DIGRAPH, On the duality for large-scale systems†, Unnamed Item, Unnamed Item, Unnamed Item, Enumeration of self‐converse digraphs, On the number of balanced signed graphs, On the point-group and line-group of a graph, Minimally strong digraphs, Enumeration of Mixed Graphs, Mathematical Sociology: Some Educational and Organizational Problems of an Emergent Sub‐Discipline, A Very General Theorem on Systems of Distinct Representatives, SELECT PROPERTIES OF THE GRAPH MODEL OF A GENERAL AUTOMATON, Grafi e strutture algebriche, Bicolored digraph grammar systems, Generalized quantification as substructural logic, THE HEIDER BALANCE: A CONTINUOUS APPROACH, Hybrid Petri net and digraph approach for deadlock prevention in automated manufacturing systems, On signed digraphs with all cycles negative, A general model for automated business diagnosis, Graph theory, The number of reachable pairs in a digraph, A brief history of balance through time, ANALYSIS OF A GENERAL LOGICAL DISCOURSE FOR MAN‐MACHINE INTERACTION—PART II, Edge Sums Of De Bruijn Interconnection Networks, Unnamed Item, Decomposition for augmented forms of large-scale systems, System identification based on point processes and correlation densities. I: The nonrefractory neuron model, A man-machine interface for computer-aided design and simulation of control systems, An improved transitive closure algorithm, The dichromatic number of a digraph, 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, A pretopological approach for structural analysis, Stock selection heuristics for interdependent items, Analyzing cognitive maps to help structure issues or problems, Structural properties of large-scale systems possessing similar structures, Model structure, complexity, and algorithmic transparency in APL, Subpath acyclic digraphs, A graph theoretic approach to similarity relations, Perfect graphs, kernels, and cores of cooperative games, A note on the characterization of Nash networks, Nonnegative matrices as a tool to model population dynamics: Classical models and contemporary expansions, 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, Convexity in directed graphs, A note on a matrix criterion for unique colorability of a signed graph, On nontransitive indifference, 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 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, 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, Bypasses in asymmetric digraphs, Determining connectedness from subdigraphs, Irreducible economies and strongly connected graphs, A faster algorithm for betweenness centrality*, Rectangular Matrices and Signed Graphs, Graph theoretic structure of the matrix inverse relating to large-scale systems, On the sum of all distances in a graph or digraph, Causality and consistency in economic models, Score sequences of oriented graphs, Graceful signed graphs: II. The case of signed cycles with connected negative sections, Controllability of linear single-input positive discrete-time systems, Unnamed Item, Conditional connectivity, Achievement and avoidance games designed from theorems, The theory of combined-arms lanchester-type models of warfare, Inverting Signed Graphs, On digraphs with the odd cycle property, Sensitivity analysis of linear systems—a structural approach, Unnamed Item, Unnamed Item, Reachability matrix and relation to large-scale systems, A formal theory of social power, Structurally fixed modes or systems described by Rosenbrock's polynomial matrices, On fuzzy cliques in fuzzy networks, Unnamed Item, Connected reorientations of mixed multigraphs, A newa priori ordering method for sparse systems of equations based on an ordered output set, A general social dilemma: Profitable exchange and intransitive group preferences, The graphs for which all strong orientations are hamiltonian, Spectral criterion for cycle balance in networks, Cycles in digraphs– a survey, Signal flow graph reduction of sampled-data systems, Partitions and homomorphisms in directed and undirected graphs, A Representation of bipartite graphs by digraphs and its programming application, Vulnerability of dynamic systems†, Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices, Unnamed Item, Pole assignment problem: a structural investigation, Unnamed Item, Unnamed Item, Ordered pairs of arcs and demiarcs†, 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 graph theoretic approach to the investigation of system‐environment relationships†, 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, On the Number of Nonzeros Added when Gaussian Elimination is Performed on Sparse Random Matrices, Degree frequencies in digraphs and tournaments, Condition for a tournament score sequence to be simple, Matrix measures for transitivity and balance*, DIRECTED GRAPH THEORY AND THE ECONOMIC ANALYSIS OF INNOVATION, Structural identification of large systems by reduction to subsystems: VLDL triglycerides, Some structural results concerning certain classes of qualitative matrices and their inverses, Robust economic models, Tie-breaking semantics and structural totality, The logical representation of extensive games, \(p\)-competition numbers, Structurally fixed modes: Decomposition and reachability, Path lengths and initial derivatives in arbitrary and Hessenberg compartmental systems, A graph-theoretic characterization of structurally fixed modes, On two classes of matrices with positive diagonal solutions to the Lyapunov equation, Signsolvability revisited, Spectral multiplicity and splitting results for a class of qualitative matrices, Social balance on networks: the dynamics of friendship and enmity, Short cycle connectivity, Extensions of graph inversion to support an artificially intelligent modeling environment, Maximum number of fixed points in regulatory Boolean networks, Information processing in complex networks: Graph entropy and information functionals, On mark sequences in 2-digraphs, A Bayesian approach to paired comparison rankings based on a graphical model, The optimum assignments and a new heuristic approach for the traveling salesman problem, Structure analyses for large scale nonlinear multipoint boundary value problems, Dimensions of election procedures: Analyses and comparisons, A characterization of competition graphs, A characterization of graphs of competition number m, An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs, 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, 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, The principal partition of a pair of graphs and its applications, Graph theoretic foundations of pathfinder networks, Graphical partially ordered sets, Reachability matrix by partitioning and related Boolean results, The hierarchical control of ST-finite-state machines, 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, 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, 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, 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, Characterization of self-complementary graphs with 2-factors, Realization of dependency structures, 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, Solution of the Hamiltonian problem for self-complementary graphs, Probabilities of homomorphic mappings from multiple graphs, Phylogeny numbers, On the out-domination and in-domination numbers of a digraph, A sharp nonconvexity bound for partition ranges of vector measures with atoms, The square of a chordal graph, Parallel concepts in graph theory, Note on eccentricities in tournaments, Detecting stable matrices, The circumplex: a slightly stronger than ordinal approach., Enumeration of labelled chain graphs and labelled essential directed acyclic graphs., Cognitive mapping expert views for policy analysis in the public sector., Phylogeny numbers for graphs with two triangles, Alarm placement in systems with fault propagation, A new graph characteristic and its application to numerical computability, Prediction of socio-economical consequences of privatization at the firm level with fuzzy cognitive mapping, Stronger-than-Lyapunov notions of matrix stability, or how ``flowers help solve problems in mathematical ecology, Inversion of \(e\)-simple block matrices, Blockmodels with maximum concentration., Special parity of perfect matchings in bipartite graphs
