Results 291 to 297 of about 337,641 (297)
Some of the next articles are maybe not open access.
Journal of Dynamic Systems, Measurement, and Control, 1975
The lack of arbitrariness in the choice of bond graph sign conventions is established. It is shown that an unoriented bond graph may have no unique meaning and that with certain choices of orientation a bond graph may not correspond to any lumped parameter system constructed from the same set of elements.
openaire +2 more sources
The lack of arbitrariness in the choice of bond graph sign conventions is established. It is shown that an unoriented bond graph may have no unique meaning and that with certain choices of orientation a bond graph may not correspond to any lumped parameter system constructed from the same set of elements.
openaire +2 more sources
National Academy Science Letters, 2019
The square graph $$G^2$$ of a graph $$G=(V,E)$$ is a graph with same vertex set as G, and the vertices are adjacent in $$G^2$$ when their distance in G is at most two. In this paper, we characterize signed graph (or sigraph) which is a square root signed graph of some signed graph.
Deepa Sinha, Deepakshi Sharma
openaire +1 more source
The square graph $$G^2$$ of a graph $$G=(V,E)$$ is a graph with same vertex set as G, and the vertices are adjacent in $$G^2$$ when their distance in G is at most two. In this paper, we characterize signed graph (or sigraph) which is a square root signed graph of some signed graph.
Deepa Sinha, Deepakshi Sharma
openaire +1 more source
Rectangular Matrices and Signed Graphs
SIAM Journal on Algebraic Discrete Methods, 1983This paper extends the theory of graphs associated with real rectangular matrices to include information about the signs of the elements. We show when signed row and column graphs can be defined for the matrix A. We also deduce conditions under which these graphs are balanced.
Greenberg, Harvey J. +2 more
openaire +2 more sources
Switched signed graphs of integer additive set-valued signed graphs
Discrete Mathematics, Algorithms and Applications, 2017Let [Formula: see text] denote a set of non-negative integers and [Formula: see text] be its power set. An integer additive set-labeling (IASL) of a graph [Formula: see text] is an injective set-valued function [Formula: see text] such that the induced function [Formula: see text] is defined by [Formula: see text], where [Formula: see text] is the ...
Naduvath, Sudev +3 more
openaire +1 more source
Journal of Discrete Mathematical Sciences and Cryptography, 2010
Abstract A signed hypergraph is an ordered triple S = (X, e, σ), where H = (X, e) is a hypergraph, called the underlying hypergraph of S, and σ : e → {−1, +1} is a function called the signature of S. Every signed hypergraph S = (X, E, σ) can be associated with a signing of its vertices by the function μσ , called the e-marking (or, equivalently the ...
openaire +1 more source
Abstract A signed hypergraph is an ordered triple S = (X, e, σ), where H = (X, e) is a hypergraph, called the underlying hypergraph of S, and σ : e → {−1, +1} is a function called the signature of S. Every signed hypergraph S = (X, E, σ) can be associated with a signing of its vertices by the function μσ , called the e-marking (or, equivalently the ...
openaire +1 more source