Related papers: Effective Resistances, Kirchhoff index and Admissi…
A Kirchhoff graph is a vector graph with orthogonal cycles and vertex cuts. An algorithm has been developed that constructs all the Kirchhoff graphs up to a fixed edge multiplicity. This algorithm is used to explore the structure of prime…
Spanning tree modulus is a generalization of effective resistance that is closely related to graph strength and fractional arboricity. The optimal edge density associated with spanning tree modulus is known to produce two hierarchical…
We study a model of random electric networks with Bernoulli resistances. In the case of the lattice Z^2, we show that the point-to-point effective resistance between 0 and a vertex v has a variance of order at most (log |v|)^(2/3) whereas…
An efficient algorithm is presented to compute the characteristic polynomial of a threshold graph. Threshold graphs were introduced by Chv\'atal and Hammer, as well as by Henderson and Zalcstein in 1977. A threshold graph is obtained from a…
(DRAFT VERSION) In this article we present a proof of the famous Kirchoff's Matrix-Tree theorem, which relates the number of spanning trees in a connected graph with the cofactors (and eigenvalues) of its combinatorial Laplacian matrix.…
We introduce new distance measures for comparing straight-line embedded graphs based on the Fr\'echet distance and the weak Fr\'echet distance. These graph distances are defined using continuous mappings and thus take the combinatorial…
A review of the theoretical approach for calculating the resistance between two arbitrary lattice points in an infinite square lattice (perfect and perturbed cases)is carried out using the Lattice Green's Function. We show how to calculate…
A graph is $\ell$-reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting $\ell$ vertices. We prove that strongly regular graphs with at least six vertices are $2$-reconstructible.
In Refs.[1] and [2], calculation of effective resistances on distance-regular networks was investigated, where in the first paper, the calculation was based on the stratification of the network and Stieltjes function associated with the…
Metric graphs are meaningful objects for modeling complex structures that arise in many real-world applications, such as road networks, river systems, earthquake faults, blood vessels, and filamentary structures in galaxies. To study metric…
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has been extensively studied, due to both its interesting structure…
We consider the problem on finding the edge weights that maximize the algebraic connectivity of a graph (smallest positive eigenvalue of the Laplacian), subject to the condition that the total effective resistance is kept constant. We…
An analytic approach is presented to developing exact expressions for the two-point resistance between arbitrary nodes on certain non-regular resistor networks. This generalises previous approaches, which only deliver results for networks…
In this paper, motivated by a question posed in \cite{AH}, we introduce strongly biconvex graphs as a subclass of weakly chordal and bipartite graphs. We give a linear time algorithm to find an induced matching for such graphs and we prove…
In this paper, we introduce a magneto-spectral invariant for finite graphs. This invariant vanishes on trees and is maximized by complete graphs. We compute this invariant for cycles, complete graphs, wheel graphs, hypercubes, complete…
Mixed variational formulations for the first-order system of the elastic membrane obstacle problem and the second-order system of the Kirchhoff--Love plate obstacle problem are proposed. The force exerted by the rigid obstacle is included…
The Casimir-Lifshitz force is calculated between two inhomogeneous composite slabs, each made of a homogeneous matrix with spherical metallic inclusions. The effective dielectric function of the slabs is calculated using several effective…
We use the Chebyshev knot diagram model of Koseleff and Pecker in order to introduce a random knot diagram model by assigning the crossings to be positive or negative uniformly at random. We give a formula for the probability of choosing a…
We study the performance of the linear consensus algorithm on strongly connected directed graphs using the linear quadratic (LQ) cost as a performance measure. In particular, we derive bounds on the LQ cost by leveraging effective…
We introduce the class of interval $H$-graphs, which is the generalization of interval graphs, particularly interval bigraphs. For a fixed graph $H$ with vertices $a_1,a_2,\dots,a_k$, we say that an input graph $G$ with given partition…