19,556 research outputs found
The lattice dimension of a graph
We describe a polynomial time algorithm for, given an undirected graph G,
finding the minimum dimension d such that G may be isometrically embedded into
the d-dimensional integer lattice Z^d.Comment: 6 pages, 3 figure
Network synchronizability analysis: the theory of subgraphs and complementary graphs
In this paper, subgraphs and complementary graphs are used to analyze the
network synchronizability. Some sharp and attainable bounds are provided for
the eigenratio of the network structural matrix, which characterizes the
network synchronizability, especially when the network's corresponding graph
has cycles, chains, bipartite graphs or product graphs as its subgraphs.Comment: 13 pages, 7 figure
An intrinsic Hamiltonian formulation of the dynamics of LC-circuits
First, the dynamics of LC-circuits are formulated as a Hamiltonian system defined with respect to a Poisson bracket which may be degenerate, i.e., nonsymplectic. This Poisson bracket is deduced from the network graph of the circuit and captures the dynamic invariants due to Kirchhoff's laws. Second, the antisymmetric relations defining the Poisson bracket are realized as a physical network using the gyrator element and partially dualizing the network graph constraints. From the network realization of the Poisson bracket, the reduced standard Hamiltonian system as well as the realization of the embedding standard Hamiltonian system are deduce
- …