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 (only showing first 100 items - show all)

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

This page was built for publication: