On the public citation graph
A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas
0 signed · 600 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1097-0118(199710)26:2<111::aid-jgt6>3.0.co;2-vopenalex-snapshot
Signed degree sequences of signed graphs
inferredcites →https://doi.org/10.1002/aic.690330703openalex-snapshot
A rule‐based approach to fault diagnosis using the signed directed graph
inferredcites →https://doi.org/10.1002/bs.3830030102openalex-snapshot
Symbolic psycho-logic: A model of attitudinal cognition
inferredcites →https://doi.org/10.1002/jgt.10049openalex-snapshot
Signed degree sequences and multigraphs
inferredcites →https://doi.org/10.1002/jgt.3190010405openalex-snapshot
Enumeration of graphs with signed points and lines
inferredcites →https://doi.org/10.1002/jgt.3190020208openalex-snapshot
Matroidal families of finite connected nonhomeomorphic graphs exist
inferredcites →https://doi.org/10.1002/jgt.3190050409openalex-snapshot
Characterizations of signed graphs
inferredcites →https://doi.org/10.1002/jgt.3190100203openalex-snapshot
On digraphs with the odd cycle property
inferredcites →https://doi.org/10.1002/jgt.3190120108openalex-snapshot
Homomorphisms of graphs into odd cycles
inferredcites →https://doi.org/10.1002/jgt.3190160503openalex-snapshot
Orientation embedding of signed graphs
inferredcites →https://doi.org/10.1002/jgt.3190200311openalex-snapshot
On Tutt's Characterization of graphic matroids—a graphic proof
inferredcites →https://doi.org/10.1002/net.3230010405openalex-snapshot
Optimal flow in networks with gains and costs
inferredcites →https://doi.org/10.1002/net.3230060403openalex-snapshot
An algebra for determining all path‐values in a network with application to K‐shortest‐paths problems
inferredcites →https://doi.org/10.1002/net.3230110303openalex-snapshot
Generalizations of Hoffman's existence theorem for circulations
inferredcites →https://doi.org/10.1002/qua.560390108openalex-snapshot
Topological analysis of eigenvalues of particle in one‐ and two‐dimensional simple quantal systems: Net sign approach
inferredcites →https://doi.org/10.1002/qua.560490204openalex-snapshot
Net signs of molecular graphs: Dependence of molecular structure
inferredcites →https://doi.org/10.1006/aama.1993.1015openalex-snapshot
Knots, Tangles, and Electrical Networks
inferredcites →https://doi.org/10.1006/aama.1996.0010openalex-snapshot
Partial Fields and Matroid Representation
inferredcites →https://doi.org/10.1006/aama.1997.0529openalex-snapshot
On Some Numbers Related to Whitney Numbers of Dowling Lattices
inferredcites →https://doi.org/10.1006/aama.1999.0670openalex-snapshot
Cohomology of Dowling Lattices and Lie (Super)Algebras
inferredcites →https://doi.org/10.1006/aima.1994.1006openalex-snapshot
The Geometry of Dowling Lattices
inferredcites →https://doi.org/10.1006/aima.1996.0059openalex-snapshot
Characteristic Polynomials of Subspace Arrangements and Finite Fields
inferredcites →https://doi.org/10.1006/aima.1997.1693openalex-snapshot
On Valuations, the Characteristic Polynomial, and Complex Subspace Arrangements
inferredcites →https://doi.org/10.1006/eujc.1997.0141openalex-snapshot
Strongly Signable and Partitionable Posets
inferredcites →https://doi.org/10.1006/eujc.1997.0149openalex-snapshot
On Free Deformations of the Braid Arrangement
inferredcites →https://doi.org/10.1006/eujc.1998.0230openalex-snapshot
Boolean Packings in Dowling Geometries
inferredcites →https://doi.org/10.1006/eujc.1999.0245openalex-snapshot
Characterizing Combinatorial Geometries by Numerical Invariants
inferredcites →https://doi.org/10.1006/jabr.1998.7476openalex-snapshot
Normal Polytopes Arising from Finite Graphs
inferredcites →https://doi.org/10.1006/jcta.1996.0038openalex-snapshot
On Integral Zeros of Krawtchouk Polynomials
inferredcites →https://doi.org/10.1006/jcta.1997.2793openalex-snapshot
A Class of Labeled Posets and the Shi Arrangement of Hyperplanes
inferredcites →https://doi.org/10.1006/jctb.1993.1034openalex-snapshot
Automorphism Groups of Higher-Weight Dowling Geometries
inferredcites →https://doi.org/10.1006/jctb.1996.0060openalex-snapshot
The Order Upper Bound on Parity Embedding of a Graph
inferredcites →https://doi.org/10.1006/jctb.1997.1766openalex-snapshot
The Largest Parity Demigenus of a Simple Graph
inferredcites →https://doi.org/10.1006/jctb.2002.2128openalex-snapshot
Packing Odd Circuits in Eulerian Graphs
inferredcites →https://doi.org/10.1007/11427186_5openalex-snapshot
Implementing Minimum Cycle Basis Algorithms
inferredcites →https://doi.org/10.1007/11753728_6openalex-snapshot
Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure
inferredcites →https://doi.org/10.1007/11764298_23openalex-snapshot
Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems
inferredcites →https://doi.org/10.1007/3-540-34774-7_34openalex-snapshot
Positive or Negative Regulatory Circuit Inference from Multilevel Dynamics
inferredcites →https://doi.org/10.1007/3-540-57182-5_10openalex-snapshot
An introduction to dynamic labeled 2-structures
inferredcites →https://doi.org/10.1007/3-540-58201-0_96openalex-snapshot
Finding even cycles even faster
inferredcites →https://doi.org/10.1007/3-540-59408-6_52openalex-snapshot
Oriented matroid polytopes and polyhedral fans are signable
inferredcites →https://doi.org/10.1007/3-540-59408-6_53openalex-snapshot
On combinatorial properties of binary spaces
inferredcites →https://doi.org/10.1007/3-540-59408-6_61openalex-snapshot
A mickey-mouse decomposition theorem
inferredcites →https://doi.org/10.1007/3-540-61228-9_108openalex-snapshot
Group based graph transformations and hierarchical representations of graphs
inferredcites →https://doi.org/10.1007/3-540-69346-7_24openalex-snapshot
Simple Generalized Maximum Flow Algorithms
inferredcites →https://doi.org/10.1007/3-540-69346-7_6openalex-snapshot
The Generalized Stable Set Problem for Claw-Free Bidirected Graphs
inferredcites →https://doi.org/10.1007/978-1-4612-2540-9openalex-snapshot
The Foundations of Topological Graph Theory
inferredcites →https://doi.org/10.1007/978-1-4612-4108-9_19openalex-snapshot
Hyperplane Arrangements, Parking Functions and Tree Inversions
inferredcites →https://doi.org/10.1007/978-1-4613-8354-3_5openalex-snapshot
Eigenvalues in Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-1-4613-8994-1_16openalex-snapshot
Some Recent Results on Signed Graphs with Least Eigenvalues ≥ -2
inferredcites →https://doi.org/10.1007/978-1-4684-6381-1openalex-snapshot
Applications of Combinatorics and Graph Theory to the Biological and Social Sciences
inferredcites →https://doi.org/10.1007/978-3-0348-6322-3_1openalex-snapshot
Some Remarks on Conflict Graphs of Quadratic Pseudo-Boolean Functions
inferredcites →https://doi.org/10.1007/978-3-0348-8974-2_4openalex-snapshot
A Combinatorial Approach to Combings and Framings of 3-manifolds
inferredcites →https://doi.org/10.1007/978-3-540-30598-9_5openalex-snapshot
A Provably Secure Short Transitive Signature Scheme from Bilinear Group Pairs
inferredcites →https://doi.org/10.1007/978-3-540-70666-3_25openalex-snapshot
The Kauffman Bracket Polynomial of Links and Universal Signed Plane Graph
inferredcites →https://doi.org/10.1007/978-3-540-72845-0_23openalex-snapshot
Optimal Edge Deletions for Signed Graph Balancing
inferredcites →https://doi.org/10.1007/978-3-540-76639-1_6openalex-snapshot
On Differentiation and Homeostatic Behaviours of Boolean Dynamical Systems
inferredcites →https://doi.org/10.1007/978-3-540-77050-3_16openalex-snapshot
A Theory for Game Theories
inferredcites →https://doi.org/10.1007/978-3-540-85101-1_14openalex-snapshot
Local Structure and Behavior of Boolean Bioregulatory Networks
inferredcites →https://doi.org/10.1007/978-3-642-02270-8_4openalex-snapshot
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains
inferredcites →https://doi.org/10.1007/978-3-642-04295-9openalex-snapshot
Geometry of Cuts and Metrics
inferredcites →https://doi.org/10.1007/978-3-642-70982-1openalex-snapshot
Mathematical Concepts in Organic Chemistry
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-94-009-5079-5_23openalex-snapshot
Qualitative Structure Analysis of Complex Systems
inferredcites →https://doi.org/10.1007/978-94-010-1220-1_9openalex-snapshot
Matroids as the Study of Geometrical Configurations
inferredcites →https://doi.org/10.1007/978-94-015-8543-9_10openalex-snapshot
Non-Frustrated Signed Graphs
inferredcites →https://doi.org/10.1007/bf01189639openalex-snapshot
Balance equations for reconstruction problems
inferredcites →https://doi.org/10.1007/bf01267866openalex-snapshot
Every group is the automorphism group of a rank-3 matroid
inferredcites →https://doi.org/10.1007/bf01389968openalex-snapshot
Linear algorithms for testing the sign stability of a matrix and for findingZ-maximum matchings in acyclic graphs
inferredcites →https://doi.org/10.1007/bf01394334openalex-snapshot
On the Kauffman polynomial of an adequate link
inferredcites →https://doi.org/10.1007/bf01442134openalex-snapshot
Solving singularly constrained generalized network problems
inferredcites →https://doi.org/10.1007/bf01455455openalex-snapshot
Arrangements defined by unitary reflection groups
inferredcites →https://doi.org/10.1007/bf01455692openalex-snapshot
�ber die Torsionszahlen der alternierenden Knoten
inferredcites →https://doi.org/10.1007/bf01581636openalex-snapshot
Characterizations of optimal scalings of matrices
inferredcites →https://doi.org/10.1007/bf01582160openalex-snapshot
Binary group and Chinese postman polyhedra
inferredcites →https://doi.org/10.1007/bf01585160openalex-snapshot
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
inferredcites →https://doi.org/10.1007/bf01585656openalex-snapshot
Extracting embedded generalized networks from linear programming problems
inferredcites →https://doi.org/10.1007/bf01587085openalex-snapshot
Recognition problems for special classes of polynomials in 0–1 variables
inferredcites →https://doi.org/10.1007/bf01589348openalex-snapshot
Connected and alternating vectors: Polyhedra and algorithms
inferredcites →https://doi.org/10.1007/bf01787483openalex-snapshot
Biased graphs whose matroids are special binary matroids
inferredcites →https://doi.org/10.1007/bf02115753openalex-snapshot
The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and bounds
inferredcites →https://doi.org/10.1007/bf02122687openalex-snapshot
Solution to a problem of C. D. Godsil regarding bipartite graphs with unique perfect matching
inferredcites →https://doi.org/10.1007/bf02289592openalex-snapshot
A Note on a Matrix Criterion for Unique Colorability of a Signed Graph
inferredcites →https://doi.org/10.1007/bf02559543openalex-snapshot
The number of homeomorphically irreducible trees, and other species
inferredcites →https://doi.org/10.1007/bf02571719openalex-snapshot
Free hyperplane arrangements betweenA n−1 andB n
inferredcites →https://doi.org/10.1007/bf02592194openalex-snapshot
Binary integer programs with two variables per inequality
inferredcites →https://doi.org/10.1007/bf02592201openalex-snapshot
On structures of bisubmodular polyhedra
inferredcites →https://doi.org/10.1007/bf02711519openalex-snapshot
Signable posets and partitionable simplicial complexes
inferredcites →https://doi.org/10.1007/bf02986689openalex-snapshot
Representation of Signed Graphs by Root System E8
inferredcites →https://doi.org/10.1007/bfb0053967openalex-snapshot
Instant recognition of half integrality and 2-approximations
inferredcites →https://doi.org/10.1007/bfb0057526openalex-snapshot
Calculating exact ground states of spin glasses: A polyhedral approach
inferredcites →https://doi.org/10.1007/bfb0066455openalex-snapshot
Structural characterizations of stability of signed digraphs under pulse processes
inferredcites →https://doi.org/10.1007/bfb0092269openalex-snapshot
A note concerning Acharya’s conjecture on a spectral measure of structural balance in a social system
inferredcites →https://doi.org/10.1007/pl00009428openalex-snapshot
On Flag Vectors, the Dowling Lattice, and Braid Arrangements
inferredcites →https://doi.org/10.1007/s00026-005-0239-xopenalex-snapshot
On the Number of Bases of Bicircular Matroids
inferredcites →https://doi.org/10.1007/s00285-009-0309-0openalex-snapshot
Graph-theoretic characterizations of monotonicity of chemical networks in reaction coordinates
inferredcites →https://doi.org/10.1007/s00373-009-0840-1openalex-snapshot
The Signless Laplacian Spectral Radius of Graphs with Given Number of Pendant Vertices
inferredcites →https://doi.org/10.1007/s00454-008-9095-5openalex-snapshot
Generalized Thrackle Drawings of Non-bipartite Graphs
inferredcites →https://doi.org/10.1007/s00493-006-0030-1openalex-snapshot
Packing Non-Zero A-Paths In Group-Labelled Graphs
inferredcites →https://doi.org/10.1007/s004930100024openalex-snapshot
The Erdős-Pósa Property for Odd Cycles in Highly Connected Graphs
inferredcites →https://doi.org/10.1007/s10440-006-9013-xopenalex-snapshot
Polyspherical Coordinate Systems on Orbit Spaces with Applications to Biomolecular Shape
inferredcites →https://doi.org/10.1007/s10801-007-0067-2openalex-snapshot
Nested set complexes of Dowling lattices and complexes of Dowling trees
inferredcites →https://doi.org/10.1016/0009-2614(89)87239-2openalex-snapshot
Topological analysis of the eigenvectors of the adjacency matrices in graph theory: Degenerate case
inferredcites →https://doi.org/10.1016/0009-2614(90)85383-nopenalex-snapshot
Topological analysis of some special of graphs. Hypercubes
inferredcites →https://doi.org/10.1016/0009-2614(92)85373-iopenalex-snapshot
Net signs and eigenvalues of molecular graphs: some analogies
inferredcites →https://doi.org/10.1016/0012-365x(77)90131-5openalex-snapshot
Generating all graph coverings by permutation voltage assignments
inferredcites →https://doi.org/10.1016/0012-365x(78)90200-5openalex-snapshot
Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices
inferredcites →https://doi.org/10.1016/0012-365x(79)90072-4openalex-snapshot
On the existence of uncountably many matroidal families
inferredcites →https://doi.org/10.1016/0012-365x(83)90016-xopenalex-snapshot
Alternating eulerian trails with prescribed degrees in two edge-colored complete graphs
inferredcites →https://doi.org/10.1016/0012-365x(86)90025-7openalex-snapshot
Switching classes of directed graphs and H-equivalent matrices
inferredcites →https://doi.org/10.1016/0012-365x(89)90141-6openalex-snapshot
The solution to Berlekamp's switching game
inferredcites →https://doi.org/10.1016/0012-365x(89)90170-2openalex-snapshot
An obstruction to embedding graphs in surfaces
inferredcites →https://doi.org/10.1016/0012-365x(90)90330-kopenalex-snapshot
Special parity of perfect matchings in bipartite graphs
inferredcites →https://doi.org/10.1016/0012-365x(91)90098-mopenalex-snapshot
On the complexity of testing for odd holes and induced odd paths
inferredcites →https://doi.org/10.1016/0012-365x(91)90304-kopenalex-snapshot
Characterization of signed graphs which are cellularly embeddable in no more than one surface
inferredcites →https://doi.org/10.1016/0012-365x(92)90048-kopenalex-snapshot
A decomposition of strongly unimodular matrices into incidence matrices of diagraphs
inferredcites →https://doi.org/10.1016/0012-365x(93)90113-8openalex-snapshot
Modular elements of higher-weight dowling lattices
inferredcites →https://doi.org/10.1016/0012-365x(93)90518-xopenalex-snapshot
The projective-planar signed graphs
inferredcites →https://doi.org/10.1016/0012-365x(95)00321-mopenalex-snapshot
Graphs without short odd cycles are nearly bipartite
inferredcites →https://doi.org/10.1016/0021-8693(84)90113-3openalex-snapshot
The characters of the wreath product group acting on the homology groups of the Dowling lattices
inferredcites →https://doi.org/10.1016/0022-2496(69)90032-7openalex-snapshot
The algebra of group kinship
inferredcites →https://doi.org/10.1016/0022-2496(72)90006-5openalex-snapshot
A derivation of a measure of relative balance for social structures and a characterization of extensive ratio systems
inferredcites →https://doi.org/10.1016/0022-2496(78)90054-8openalex-snapshot
Consistency in marked digraphs
inferredcites →https://doi.org/10.1016/0022-2496(78)90060-3openalex-snapshot
Studies on the balancing, the minimal balancing, and the minimum balancing processes for social groups with planar and nonplanar graph structures
inferredcites →https://doi.org/10.1016/0024-3795(80)90234-7openalex-snapshot
Matrices diagonally similar to a symmetric matrix
inferredcites →https://doi.org/10.1016/0024-3795(81)90153-1openalex-snapshot
Matrices with zero line sums and maximal rank
inferredcites →https://doi.org/10.1016/0024-3795(82)90127-6openalex-snapshot
Graph-theoretical approach to qualitative solvability of linear systems
inferredcites →https://doi.org/10.1016/0024-3795(83)90166-0openalex-snapshot
Sign patterns of inverse nonnegative matrices
inferredcites →https://doi.org/10.1016/0024-3795(88)90247-9openalex-snapshot
Some properties of GM-matrices and their inverses
inferredcites →https://doi.org/10.1016/0024-3795(89)90479-5openalex-snapshot
On the existence of an integral potential in a weighted bidirected graph
inferredcites →https://doi.org/10.1016/0024-3795(93)90366-vopenalex-snapshot
Nonsingular sign patterns and the orthogonal group
inferredcites →https://doi.org/10.1016/0024-3795(93)90535-vopenalex-snapshot
Spectra with positive elementary symmetric functions
inferredcites →https://doi.org/10.1016/0024-3795(94)90398-0openalex-snapshot
On the period and base of a sign pattern matrix
inferredcites →https://doi.org/10.1016/0024-3795(95)00054-2openalex-snapshot
On maximal sign-nonsingular matrices
inferredcites →https://doi.org/10.1016/0095-8956(77)90031-4openalex-snapshot
The matroids with the max-flow min-cut property
inferredcites →https://doi.org/10.1016/0095-8956(79)90062-5openalex-snapshot
Hajós' graph-coloring conjecture: Variations and counterexamples
inferredcites →https://doi.org/10.1016/0095-8956(81)90042-3openalex-snapshot
A minimax theorem on circuits in projective graphs
inferredcites →https://doi.org/10.1016/0095-8956(83)90008-4openalex-snapshot
Alternating cycles in edge-partitioned graphs
inferredcites →https://doi.org/10.1016/0095-8956(83)90040-0openalex-snapshot
Enumeration of connected invariant graphs
inferredcites →https://doi.org/10.1016/0095-8956(87)90026-8openalex-snapshot
Balanced decompositions of a signed graph
inferredcites →https://doi.org/10.1016/0095-8956(87)90032-3openalex-snapshot
Nowhere-zero integral chains and flows in bidirected graphs
inferredcites →https://doi.org/10.1016/0095-8956(87)90051-7openalex-snapshot
The biased graphs whose matroids are binary
inferredcites →https://doi.org/10.1016/0095-8956(87)90061-xopenalex-snapshot
Characterization of even directed graphs
inferredcites →https://doi.org/10.1016/0095-8956(89)90028-2openalex-snapshot
Cantankerous maps and rotary embeddings of Kn
inferredcites →https://doi.org/10.1016/0095-8956(90)90062-5openalex-snapshot
Undirected distances and the postman-structure of graphs
inferredcites →https://doi.org/10.1016/0095-8956(90)90095-hopenalex-snapshot
The long-line graph of a combinatorial geometry. II. Geometries representable over two fields of different characteristics
inferredcites →https://doi.org/10.1016/0095-8956(92)90016-qopenalex-snapshot
Group connectivity of graphs—A nonhomogeneous analogue of nowhere-zero flow properties
inferredcites →https://doi.org/10.1016/0095-8956(92)90048-3openalex-snapshot
Vertex-switching reconstruction of subgraph numbers and triangle-free graphs
inferredcites →https://doi.org/10.1016/0097-3165(73)90006-xopenalex-snapshot
On copositive matrices with −1, 0, 1 entries
inferredcites →https://doi.org/10.1016/0097-3165(75)90012-6openalex-snapshot
Logarithmic concavity for a class of geometric lattices
inferredcites →https://doi.org/10.1016/0097-3165(89)90014-9openalex-snapshot
Minimal quadrangulations of nonorientable surfaces
inferredcites →https://doi.org/10.1016/0165-4896(83)90050-1openalex-snapshot
An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs
inferredcites →https://doi.org/10.1016/0166-218x(80)90038-4openalex-snapshot
On deciding switching equivalence of graphs
inferredcites →https://doi.org/10.1016/0166-218x(88)90043-1openalex-snapshot
On signed digraphs with all cycles negative
inferredcites →https://doi.org/10.1016/0166-218x(89)90053-xopenalex-snapshot
Pfaffian orientations, 0–1 permanents, and even cycles in directed graphs
inferredcites →https://doi.org/10.1016/0166-218x(92)90273-dopenalex-snapshot
König-Egerváry graphs, 2-bicritical graphs and fractional matchings
inferredcites →https://doi.org/10.1016/0166-218x(93)90230-lopenalex-snapshot
A linear algorithm for the group path problem on chordal graphs
inferredcites →https://doi.org/10.1016/0166-218x(93)90243-hopenalex-snapshot
Recognizing hidden bicircular networks
inferredcites →https://doi.org/10.1016/0166-218x(94)90169-4openalex-snapshot
Network models in optimization and their applications in practice
inferredcites →https://doi.org/10.1016/0166-218x(95)00010-oopenalex-snapshot
Negative cycles in complete signed graphs
inferredcites →https://doi.org/10.1016/0166-218x(95)00068-3openalex-snapshot
Decomposition of a bidirected graph into strongly connected components and its signed poset structure
inferredcites →https://doi.org/10.1016/0167-6377(85)90013-6openalex-snapshot
On negative cycles in mixed graphs
inferredcites →https://doi.org/10.1016/0167-6377(85)90021-5openalex-snapshot
New labeling procedures for the basis graph in generalized networks
inferredcites →https://doi.org/10.1016/0195-6698(92)90027-wopenalex-snapshot
Signed graphs with least eigenvalue <−2
inferredcites →https://doi.org/10.1016/0304-3975(80)90009-2openalex-snapshot
The directed subgraph homeomorphism problem
inferredcites →https://doi.org/10.1016/0377-2217(85)90091-8openalex-snapshot
Solving embedded generalized network problems
inferredcites →https://doi.org/10.1016/0378-8733(79)90004-2openalex-snapshot
Balance in stochastic signed graphs
inferredcites →https://doi.org/10.1016/0378-8733(79)90019-4openalex-snapshot
Response bias in the survey interview; an approach from balance theory
inferredcites →https://doi.org/10.1016/0378-8733(80)90005-2openalex-snapshot
Connectedness in a general model for valued networks
inferredcites →https://doi.org/10.1016/0378-8733(82)90002-8openalex-snapshot
Acyclic triplets and social structure in complete signed digraphs
inferredcites →https://doi.org/10.1016/0378-8733(95)00259-6openalex-snapshot
A partitioning approach to structural balance
inferredcites →https://doi.org/10.1016/b978-0-12-189420-7.50022-0openalex-snapshot
TWO-GRAPHS, A SECOND SURVEY
inferredcites →https://doi.org/10.1016/b978-0-12-299680-1.50020-3openalex-snapshot
MAYBEE'S “SIGN SOLVABILITY”
inferredcites →https://doi.org/10.1016/b978-0-12-299680-1.50024-0openalex-snapshot
HIDDEN STRUCTURE IN LINEAR PROGRAMS
inferredcites →https://doi.org/10.1016/b978-044488002-4/50043-9openalex-snapshot
10.1016/b978-044488002-4/50043-9
inferredcites →https://doi.org/10.1016/c2013-0-10764-7openalex-snapshot
Computer-Assisted Analysis and Model Simplification
inferredcites →https://doi.org/10.1016/j.aam.2004.02.002openalex-snapshot
The Kauffman brackets for equivalence classes of links
inferredcites →https://doi.org/10.1016/j.aam.2004.07.003openalex-snapshot
Reconstructing ternary Dowling geometries
inferredcites →https://doi.org/10.1016/j.cplett.2008.01.055openalex-snapshot
Net-sign identity information index: A novel approach towards numerical characterization of chemical signed graph theory
inferredcites →https://doi.org/10.1016/j.dam.2007.10.024openalex-snapshot
A note on the signed edge domination number in graphs
inferredcites →https://doi.org/10.1016/j.dam.2008.05.017openalex-snapshot
On a relation between the domination number and a strongly connected bidirection of an undirected graph
inferredcites →https://doi.org/10.1016/j.dam.2009.06.017openalex-snapshot
Positive circuits and maximal number of fixed points in discrete dynamical systems
inferredcites →https://doi.org/10.1016/j.disc.2004.06.015openalex-snapshot
The correct solution to Berlekamp's switching game
inferredcites →https://doi.org/10.1016/j.disc.2004.06.023openalex-snapshot
On flows in bidirected graphs
inferredcites →https://doi.org/10.1016/j.disc.2004.07.039openalex-snapshot
Recent work in matroid representation theory
inferredcites →https://doi.org/10.1016/j.disc.2007.07.073openalex-snapshot
Packing non-returning A-paths algorithmically
inferredcites →https://doi.org/10.1016/j.disc.2007.07.108openalex-snapshot
Orbit-counting polynomials for graphs and codes
inferredcites →https://doi.org/10.1016/j.disc.2008.05.012openalex-snapshot
Harmonic conjugation in harmonic matroids
inferredcites →https://doi.org/10.1016/j.disc.2008.06.039openalex-snapshot
The k th upper bases of primitive non-powerful signed digraphs
inferredcites →https://doi.org/10.1016/j.disc.2009.04.026openalex-snapshot
The multivariate signed Bollobás–Riordan polynomial
inferredcites →https://doi.org/10.1016/j.ejc.2005.04.011openalex-snapshot
Lindström’s conjecture on a class of algebraically non-representable matroids
showing the first 200 of 407 · page through all 407
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.20145openalex-snapshot
Signed graph factors and degree sequences
inferred← citeshttps://doi.org/10.1007/11494645_23openalex-snapshot
Combinatorial Models of Gene Assembly
inferred← citeshttps://doi.org/10.1007/978-1-4939-0781-6_12openalex-snapshot
Generic Rigidity with Forced Symmetry and Sparse Colored Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-17402-6_28openalex-snapshot
Complexity of Vertex Switching on Edge-Bicolored Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-23756-1_5openalex-snapshot
A Study on Vulnerability Parameters of Signed Fuzzy Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-57602-8_36openalex-snapshot
Approximation Algorithms for Balancing Signed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-81386-4_16openalex-snapshot
Line Graphs of Signed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-84122-5_41openalex-snapshot
Spectra of Signed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-19582-1_10openalex-snapshot
Variable Formulation Search for the Cyclic Min-Max Sitting Arrangement Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-94830-0_3openalex-snapshot
Computing the Line Index of Balance Using Integer Programming Optimisation
inferred← citeshttps://doi.org/10.1007/978-3-540-72845-0_23openalex-snapshot
Optimal Edge Deletions for Signed Graph Balancing
inferred← citeshttps://doi.org/10.1007/978-3-642-29047-3_7openalex-snapshot
Cultural Consensus Theory: Aggregating Signed Graphs under a Balance Constraint
inferred← citeshttps://doi.org/10.1007/978-3-642-36065-7_23openalex-snapshot
Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-38768-5_39openalex-snapshot
Maximum Balanced Subgraph Problem Parameterized above Lower Bound
inferred← citeshttps://doi.org/10.1007/978-981-33-4389-4_1openalex-snapshot
Maximum Matching in Koch Snowflake and Sierpinski Triangle
inferred← citeshttps://doi.org/10.1007/s00373-014-1481-6openalex-snapshot
A Bivariate Chromatic Polynomial for Signed Graphs
inferred← citeshttps://doi.org/10.1007/s00373-015-1666-7openalex-snapshot
Balanced Signed Total Graphs of Commutative Rings
inferred← citeshttps://doi.org/10.1007/s00454-005-1170-6openalex-snapshot
Criteria for Balance in Abelian Gain Graphs, with Applications to Piecewise-Linear Geometry
inferred← citeshttps://doi.org/10.1007/s00454-015-9697-7openalex-snapshot
Inductive Constructions for Frameworks on a Two-Dimensional Fixed Torus
inferred← citeshttps://doi.org/10.1007/s00493-016-3502-yopenalex-snapshot
Inverses of Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s10711-013-9878-6openalex-snapshot
Frameworks with forced symmetry II: orientation-preserving crystallographic groups
inferred← citeshttps://doi.org/10.1007/s10711-015-0133-1openalex-snapshot
Symmetry-forced rigidity of frameworks on surfaces
inferred← citeshttps://doi.org/10.1007/s10801-020-00977-wopenalex-snapshot
A group representation approach to balance of gain graphs
inferred← citeshttps://doi.org/10.1007/s10801-024-01332-zopenalex-snapshot
Construction of cospectral graphs, signed graphs and $${\mathbb {T}}$$-gain graphs via partial transpose
inferred← citeshttps://doi.org/10.1007/s10878-009-9212-2openalex-snapshot
Separator-based data reduction for signed graph balancing
inferred← citeshttps://doi.org/10.1007/s10898-020-00989-7openalex-snapshot
Integer programming formulations and efficient local search for relaxed correlation clustering
inferred← citeshttps://doi.org/10.1007/s11047-015-9527-0openalex-snapshot
Counter machines and crystallographic structures
inferred← citeshttps://doi.org/10.1007/s11590-023-02066-wopenalex-snapshot
A mathematical programming approach for recognizing binet matrices
inferred← citeshttps://doi.org/10.1007/s11693-007-9005-9openalex-snapshot
Monotone and near-monotone biochemical networks
inferred← citeshttps://doi.org/10.1007/s40009-015-0373-5openalex-snapshot
Canonical Consistency of Semi-Total Line Signed Graphs
inferred← citeshttps://doi.org/10.1007/s40009-018-0643-0openalex-snapshot
On the Properties of Square Signed Graph
inferred← citeshttps://doi.org/10.1007/s40009-019-00836-8openalex-snapshot
Beck’s Zero-Divisor Graph in the Realm of Signed Graph
inferred← citeshttps://doi.org/10.1007/s40324-021-00275-wopenalex-snapshot
The many facets of the Estrada indices of graphs and networks
inferred← citeshttps://doi.org/10.1007/s40840-015-0264-4openalex-snapshot
Characterization of Signed Graphs Whose Iterated Signed Line Graphs are Balanced or S-Consistent
inferred← citeshttps://doi.org/10.1007/s40840-015-0281-3openalex-snapshot
Consistency in the Naturally Vertex-Signed Line Graph of a Signed Graph
inferred← citeshttps://doi.org/10.1016/j.advengsoft.2012.08.002openalex-snapshot
A graph based requirements clustering approach for component selection
inferred← citeshttps://doi.org/10.1016/j.aim.2012.10.007openalex-snapshot
Generic combinatorial rigidity of periodic frameworks
inferred← citeshttps://doi.org/10.1016/j.amc.2021.126082openalex-snapshot
Locating eigenvalues of unbalanced unicyclic signed graphs
inferred← citeshttps://doi.org/10.1016/j.cor.2015.12.004openalex-snapshot
A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem
inferred← citeshttps://doi.org/10.1016/j.dam.2014.05.012openalex-snapshot
Weighted Coxeter graphs and generalized geometric representations of Coxeter groups
inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.013openalex-snapshot
12th Cologne-Twente workshop on graphs and combinatorial optimization (CTW 2013)
inferred← citeshttps://doi.org/10.1016/j.dam.2016.02.018openalex-snapshot
Signed line graphs with least eigenvalue −2 : The star complement technique
inferred← citeshttps://doi.org/10.1016/j.dam.2017.03.015openalex-snapshot
Unicyclic signed graphs with minimal energy
inferred← citeshttps://doi.org/10.1016/j.dam.2018.11.022openalex-snapshot
A branch-and-cut algorithm for the maximum k -balanced subgraph of a signed graph
inferred← citeshttps://doi.org/10.1016/j.dam.2019.04.019openalex-snapshot
Rethinking structural balance in signed social networks
inferred← citeshttps://doi.org/10.1016/j.dam.2020.03.022openalex-snapshot
Signed analogue of general Kotzig–Lovász decomposition
inferred← citeshttps://doi.org/10.1016/j.dam.2020.03.029openalex-snapshot
Complexity of planar signed graph homomorphisms to cycles
inferred← citeshttps://doi.org/10.1016/j.dam.2020.09.021openalex-snapshot
Tutte’s dichromate for signed graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.04.049openalex-snapshot
Information dissemination and confusion in signed networks
inferred← citeshttps://doi.org/10.1016/j.disc.2006.11.004openalex-snapshot
Decompositions of signed-graphic matroids
inferred← citeshttps://doi.org/10.1016/j.disc.2011.09.021openalex-snapshot
Balanced group-labeled graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2011.12.010openalex-snapshot
Six signed Petersen graphs, and their automorphisms
inferred← citeshttps://doi.org/10.1016/j.disc.2013.02.010openalex-snapshot
Velocity polytopes of periodic graphs and a no-go theorem for digital physics
inferred← citeshttps://doi.org/10.1016/j.disc.2013.12.003openalex-snapshot
Groups of balanced labelings on graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2014.03.022openalex-snapshot
Bicircular signed-graphic matroids
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112827openalex-snapshot
Unit gain graphs with two distinct eigenvalues and systems of lines in complex space
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113838openalex-snapshot
A switching method for constructing cospectral gain graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114433openalex-snapshot
On the complement of a signed graph
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114747openalex-snapshot
Correlation clustering for general graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2008.01.022openalex-snapshot
The flow and tension spaces and lattices of signed graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2008.02.004openalex-snapshot
Totally frustrated states in the chromatic theory of gain graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103222openalex-snapshot
Homomorphisms of signed graphs: An update
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103280openalex-snapshot
Graph covers with two new eigenvalues
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103479openalex-snapshot
Characterizations of line graphs in signed and gain graphs
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.12.036openalex-snapshot
The maximum balanced subgraph of a signed graph: Applications and solution approaches
inferred← citeshttps://doi.org/10.1016/j.endm.2017.11.036openalex-snapshot
Line Signed Graph of a Signed Total Graph
inferred← citeshttps://doi.org/10.1016/j.endm.2017.11.040openalex-snapshot
Unitary Cayley Meet Signed Graphs
inferred← citeshttps://doi.org/10.1016/j.fss.2026.109911openalex-snapshot
Certified graph-cut separation for 3-additive capacities via signed switching
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.02.002openalex-snapshot
Enumeration of balanced finite group valued functions on directed graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2010.10.026openalex-snapshot
On products and line graphs of signed graphs, their eigenvalues and energy
inferred← citeshttps://doi.org/10.1016/j.laa.2014.01.001openalex-snapshot
Balancedness and the least eigenvalue of Laplacian of signed graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2014.05.004openalex-snapshot
Universal state transfer on graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2015.02.007openalex-snapshot
On the Laplacian coefficients of signed graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2015.04.022openalex-snapshot
Spectral characterizations of signed lollipop graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2016.07.008openalex-snapshot
On eigenspaces of some compound signed graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2016.08.011openalex-snapshot
Laplacian matrices of general complex weighted directed graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2016.10.020openalex-snapshot
Graph invertibility and median eigenvalues
inferred← citeshttps://doi.org/10.1016/j.laa.2018.05.012openalex-snapshot
Spectral characterizations of signed cycles
inferred← citeshttps://doi.org/10.1016/j.laa.2018.07.026openalex-snapshot
Signed bicyclic graphs minimizing the least Laplacian eigenvalue
inferred← citeshttps://doi.org/10.1016/j.laa.2020.11.009openalex-snapshot
Gain-line graphs via G-phases and group representations
inferred← citeshttps://doi.org/10.1016/j.laa.2024.03.002openalex-snapshot
Gain total graphs and their spectra via G-phases and group representations
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.021openalex-snapshot
On switching classes, NLC-width, cliquewidth and treewidth
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.10.026openalex-snapshot
Maximum balanced subgraph problem parameterized above lower bound
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114580openalex-snapshot
List homomorphisms to separable signed graphs
inferred← citeshttps://doi.org/10.1016/s0095-8956(03)00035-2openalex-snapshot
Biased graphs IV: Geometrical realizations
inferred← citeshttps://doi.org/10.1038/s41598-020-71838-6openalex-snapshot
Multilevel structural evaluation of signed directed social networks based on balance theory
inferred← citeshttps://doi.org/10.1038/s41598-021-91266-4openalex-snapshot
Loss of structural balance in stock markets
inferred← citeshttps://doi.org/10.1049/iet-syb.2009.0040openalex-snapshot
Determining the distance to monotonicity of a biological network: a graph-theoretical approach
inferred← citeshttps://doi.org/10.1051/ro/2021150openalex-snapshot
A matheuristic approach for the maximum balanced subgraph of a signed graph
inferred← citeshttps://doi.org/10.1063/5.0016908openalex-snapshot
C-cordial labeling of line signed graphs-I
inferred← citeshttps://doi.org/10.1080/03081087.2015.1107020openalex-snapshot
On graphs whose least eigenvalue is greater than –2
inferred← citeshttps://doi.org/10.1080/03081087.2015.1120701openalex-snapshot
On signed graphs whose second largest Laplacian eigenvalue does not exceed 3
inferred← citeshttps://doi.org/10.1080/03081087.2018.1472737openalex-snapshot
Spectral analysis of t-path signed graphs
inferred← citeshttps://doi.org/10.1080/03081087.2018.1494122openalex-snapshot
Connected signed graphs L-cospectral to signed ∞-graphs
inferred← citeshttps://doi.org/10.1080/03081087.2019.1694483openalex-snapshot
Constructing cospectral signed graphs
inferred← citeshttps://doi.org/10.1080/09720529.2010.10698314openalex-snapshot
Signed intersection graphs
inferred← citeshttps://doi.org/10.1080/09720529.2016.1187959openalex-snapshot
Negation switching invariant 3-Path signed graphs
inferred← citeshttps://doi.org/10.1080/09728600.2023.2243619openalex-snapshot
Additively graceful signed graphs
inferred← citeshttps://doi.org/10.1080/15427951.2014.912994openalex-snapshot
Weak Balance in Random Signed Graphs
inferred← citeshttps://doi.org/10.1080/23311835.2016.1186135openalex-snapshot
Double domination in signed graphs
inferred← citeshttps://doi.org/10.1088/1367-2630/ae49b6openalex-snapshot
Performance of parity QAOA for the signed Max-Cut problem
inferred← citeshttps://doi.org/10.1093/imrn/rnu050openalex-snapshot
The Arithmetic Tutte Polynomials of the Classical Root Systems
inferred← citeshttps://doi.org/10.1109/access.2025.3612924openalex-snapshot
ABCD: Algorithm for Balanced Component Discovery in Signed Networks
inferred← citeshttps://doi.org/10.1109/amathe61652.2024.10582168openalex-snapshot
Graph-Theoretic Insights into Birth Rate Trends: Exploring Platt Number in Constructed Signed Network
inferred← citeshttps://doi.org/10.1109/cdc.2014.7039449openalex-snapshot
Stability of dynamical systems on a graph
inferred← citeshttps://doi.org/10.1109/icsctet.2015.7371190openalex-snapshot
Algorithmic characterization of signed graphs whose two path signed graphs and square graphs are isomorphic
inferred← citeshttps://doi.org/10.1109/tqe.2021.3122568openalex-snapshot
Classically Optimal Variational Quantum Algorithms
inferred← citeshttps://doi.org/10.1137/s0895480100381890openalex-snapshot
A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs
inferred← citeshttps://doi.org/10.1142/s0219265915500115openalex-snapshot
On Square and 2-path Signed Graph
inferred← citeshttps://doi.org/10.1145/3366423.3380212openalex-snapshot
Finding large balanced subgraphs in signed networks
inferred← citeshttps://doi.org/10.1155/2020/1028941openalex-snapshot
Characterization of 2-Path Signed Network
inferred← citeshttps://doi.org/10.11575/cdm.v9i1.62183openalex-snapshot
The rigidity of periodic frameworks as graphs on a fixed torus
inferred← citeshttps://doi.org/10.1186/1752-0509-4-83openalex-snapshot
Monotonicity, frustration, and ordered response: an analysis of the energy landscape of perturbed large-scale biological networks
inferred← citeshttps://doi.org/10.12723/mjs.23.1openalex-snapshot
Sign-Compatibility of Some Derived Signed Graphs
inferred← citeshttps://doi.org/10.12988/ams.2014.4116openalex-snapshot
Edge neighborhood signed graphs
inferred← citeshttps://doi.org/10.12988/ijcms.2014.410108openalex-snapshot
Equienergetic net-regular signed graphs
inferred← citeshttps://doi.org/10.12988/imf.2013.310198openalex-snapshot
On open domination and domination in signed graphs
inferred← citeshttps://doi.org/10.13001/ela.2020.5077openalex-snapshot
The least Laplacian eigenvalue of the unbalanced unicyclic signed graphs with $k$ pendant vertices
inferred← citeshttps://doi.org/10.13001/ela.2021.5249openalex-snapshot
Line graphs of complex unit gain graphs with least eigenvalue -2
inferred← citeshttps://doi.org/10.13001/ela.2025.9031openalex-snapshot
Godsil-McKay switchings for gain graphs
inferred← citeshttps://doi.org/10.1371/journal.pcbi.1004881openalex-snapshot
Quorum-Sensing Synchronization of Synthetic Toggle Switches: A Design Based on Monotone Dynamical Systems Theory
inferred← citeshttps://doi.org/10.14429/dsj.56.1948openalex-snapshot
Construction of Graceful Signed Graphs
inferred← citeshttps://doi.org/10.1515/spma-2022-0169openalex-snapshot
On cospectrality of gain graphs
inferred← citeshttps://doi.org/10.1515/spma-2024-0007openalex-snapshot
Eigenpairs of adjacency matrices of balanced signed graphs
inferred← citeshttps://doi.org/10.1529/biophysj.107.125021openalex-snapshot
The Effect of Negative Feedback Loops on the Dynamics of Boolean Networks
inferred← citeshttps://doi.org/10.18257/raccefyn.1189openalex-snapshot
The arithmetic of Coxeter permutahedra
inferred← citeshttps://doi.org/10.22049/cco.2017.13578openalex-snapshot
On net-Laplacian energy of signed graphs
inferred← citeshttps://doi.org/10.22108/toc.2013.3658openalex-snapshot
Directionally $n$-Signed Graphs-III: The Notion of Symmetric Balance
inferred← citeshttps://doi.org/10.22147/jusps-a/300105openalex-snapshot
Note on Super Radial Signed Graphs
inferred← citeshttps://doi.org/10.22199/issn.0717-6279-6376openalex-snapshot
Singularity of cycle-spliced signed graphs
inferred← citeshttps://doi.org/10.23919/ecc.2018.8550192openalex-snapshot
A Generalized Discrete-Time Altafini Model
inferred← citeshttps://doi.org/10.2478/ausi-2023-0001openalex-snapshot
On domination in signed graphs
inferred← citeshttps://doi.org/10.2478/jamsi-2019-0003openalex-snapshot
A remark on eigen values of signed graph
inferred← citeshttps://doi.org/10.26421/qic13.5-6-10openalex-snapshot
Perfect state transfer on signed graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.2902.f01openalex-snapshot
On adjacency and Laplacian cospectral non-isomorphic signed graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.910.460openalex-snapshot
Balanced Abelian group-valued functions on directed graphs
inferred← citeshttps://doi.org/10.26493/2590-9770.1286.d7bopenalex-snapshot
Open problems in the spectral theory of signed graphs
inferred← citeshttps://doi.org/10.3233/fi-2012-672openalex-snapshot
Subgroup Switching of Skew Gain Graphs
inferred← citeshttps://doi.org/10.32920/ryerson.14638437openalex-snapshot
Symmetry Adapted Assur Decompositions
inferred← citeshttps://doi.org/10.32920/ryerson.14638437.v1openalex-snapshot
Symmetry Adapted Assur Decompositions
inferred← citeshttps://doi.org/10.3390/math10152633openalex-snapshot
On Some Properties of Signed Cayley Graph Sn
inferred← citeshttps://doi.org/10.3390/math10193492openalex-snapshot
On Some Properties of Addition Signed Cayley Graph Σn∧
inferred← citeshttps://doi.org/10.3390/math7100926openalex-snapshot
Line and Subdivision Graphs Determined by T 4 -Gain Graphs
inferred← citeshttps://doi.org/10.3390/math9161990openalex-snapshot
On the Aα-Eigenvalues of Signed Graphs
inferred← citeshttps://doi.org/10.3390/sym6030516openalex-snapshot
Symmetry Adapted Assur Decompositions
inferred← citeshttps://doi.org/10.37236/2212openalex-snapshot
Periodic Rigidity on a Variable Torus Using Inductive Constructions
inferred← citeshttps://doi.org/10.3906/mat-1704-20openalex-snapshot
Co-maximal signed graphs of commutative rings
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2020.20openalex-snapshot
Homomorphisms of signed graphs: An update
inferred← citeshttps://doi.org/10.48550/arxiv.1108.2518openalex-snapshot
Generic rigidity of frameworks with orientation-preserving crystallographic symmetry
inferred← citeshttps://doi.org/10.48550/arxiv.1203.6561openalex-snapshot
Inductive constructions for frameworks on a two-dimensional fixed torus
inferred← citeshttps://doi.org/10.48550/arxiv.1204.0503openalex-snapshot
Henneberg constructions and covers of cone-Laman graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1204.1349openalex-snapshot
Periodic Rigidity on a Variable Torus Using Inductive Constructions
inferred← citeshttps://doi.org/10.48550/arxiv.1204.2568openalex-snapshot
A bivariate chromatic polynomial for signed graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1303.3083openalex-snapshot
Matrices in the Theory of Signed Simple Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1303.3084openalex-snapshot
Directionally 2-Signed and Bidirected Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1303.5456openalex-snapshot
Balanced Abelian group valued functions on directed graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1305.6621openalex-snapshot
The arithmetic Tutte polynomials of the classical root systems
inferred← citeshttps://doi.org/10.48550/arxiv.1306.1763openalex-snapshot
Bipartite graphs are weak antimagic
inferred← citeshttps://doi.org/10.48550/arxiv.1312.1480openalex-snapshot
Symmetry-forced rigidity of frameworks on surfaces
inferred← citeshttps://doi.org/10.48550/arxiv.1608.06944openalex-snapshot
Nowhere-zero flows in signed graphs: A survey
inferred← citeshttps://doi.org/10.48550/arxiv.1708.03077openalex-snapshot
A note on the vertex arboricity of signed graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1708.08132openalex-snapshot
Topological Tutte Polynomial
inferred← citeshttps://doi.org/10.48550/arxiv.1709.07414openalex-snapshot
Bidirected Graphs I: Signed General Kotzig-Lovász Decomposition
inferred← citeshttps://doi.org/10.48550/arxiv.2006.03584openalex-snapshot
Characterizations of Some Parity Signed Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2009.08708openalex-snapshot
On the Characteristic Polynomial of Skew Gain Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2011.05753openalex-snapshot
Some properties of Cayley signed graphs on finite abelian groups
inferred← citeshttps://doi.org/10.48550/arxiv.2012.13079openalex-snapshot
The Hoffman program of graphs: old and new
inferred← citeshttps://doi.org/10.48550/arxiv.2105.09149openalex-snapshot
Unit gain graphs with two distinct eigenvalue and systems of lines in complex space
inferred← citeshttps://doi.org/10.48550/arxiv.2109.01221openalex-snapshot
The Optimization of Signed Trees
inferred← citeshttps://doi.org/10.48550/arxiv.math/0609048openalex-snapshot
Totally frustrated states in the chromatic theory of gain graphs
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3938openalex-snapshot
Recognition of generalized network matrices
inferred← citeshttps://doi.org/10.5281/zenodo.23198openalex-snapshot
On Signed Graphs Whose Two Path Signed Graphs Are Switching Equivalent To Their Jump Signed Graphs
inferred← citeshttps://doi.org/10.5281/zenodo.823843openalex-snapshot
Total Minimal Dominating Signed Graph
inferred← citeshttps://doi.org/10.5281/zenodo.9343openalex-snapshot
Negation Switching Equivalence In Signed Graphs
inferred← citeshttps://doi.org/10.5281/zenodo.9644openalex-snapshot
Smarandache Directionally N-Signed Graphs — A Survey
inferred← citeshttps://doi.org/10.55016/ojs/cdm.v17i2.62734openalex-snapshot
Hamilton cycles in bidirected complete graphs
inferred← citeshttps://doi.org/10.55016/ojs/cdm.v9i1.62183openalex-snapshot
The rigidity of periodic frameworks as graphs on a fixed torus
inferred← citeshttps://doi.org/10.5555/2884435.2884580openalex-snapshot
Weak duality for packing edge-disjoint odd (u, v)-trails
inferred← citeshttps://doi.org/10.5666/kmj.2014.54.1.95openalex-snapshot
The Line n-sigraph of a Symmetric n-sigraph-V
inferred← citeshttps://doi.org/10.70675/909bbe94z5fa8z4ba3z80bbzc56545575d65openalex-snapshot
Characterizing edges in signed and vector-valued graphs
inferred← citeshttps://doi.org/10.70675/d8460c8eze24bz40a0za732z91edbff20694openalex-snapshot
From planar graphs to higher dimension
inferred← citeshttps://doi.org/10.7151/dmgt.1374openalex-snapshot
Towards a characterization of bipartite switching classes by means of forbidden subgraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1570openalex-snapshot
Some results on semi-total signed graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2281openalex-snapshot
Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs
inferred← citeshttps://doi.org/10.7546/nntdm.2018.24.3.131-141openalex-snapshot
Embedding of signed regular graphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.