Results 1 to 10 of about 355 (50)

Relations between connected and self-avoiding walks in a digraph [PDF]

, 2015
Walks in a directed graph can be given a partially ordered structure that extends to possibly unconnected objects, called hikes. Studying the incidence algebra on this poset reveals unsuspected relations between walks and self-avoiding hikes.
Espinasse, Thibault, Rochet, Paul
core   +3 more sources

On the Potts model partition function in an external field

, 2012
We study the partition function of Potts model in an external (magnetic) field, and its connections with the zero-field Potts model partition function. Using a deletion-contraction formulation for the partition function Z for this model, we show that it ...
A.D. Sokal, A.D. Sokal, A.D. Sokal, B. Bollobás, B. Bollobás, B.A. Berg, C. Schulze, C.M. Fortuin, D. Andrén, D.J.A. Welsh, D.J.A. Welsh, E.H. Lieb, F.Y. Wu, F.Y. Wu, F.Y. Wu, G. Royle, G.E. Andrews, H. Meyer-Ortmanns, H.-O. Georgii, Iain Moffatt, J. Ellis-Monaghan, L. Beaudin, L. Traldi, L.A. Goldberg, Leslie M. McDonald, M. Aizenman, M. Biskup, N.B. Ouchi, R. Shrock, R.B. Potts, R.J. Baxter, S. Sanyal, S. Turner, S.C. Chang, S.C. Chang, S.D. Noble, T.C. Schelling, V. Jones, Y. Watanabe   +38 more
core   +2 more sources

Computing the determinant of a signed graph

Open Mathematics
A signed graph is a simple graph in which every edge has a positive or negative sign. In this article, we employ several algebraic techniques to compute the determinant of a signed graph in terms of the spectrum of a vertex-deleted subgraph.
Alshamary Bader, Stanić Zoran
doaj   +1 more source

On the spectral distribution of large weighted random regular graphs [PDF]

, 2013
McKay proved that the limiting spectral measures of the ensembles of $d$-regular graphs with $N$ vertices converge to Kesten's measure as $N\to\infty$. In this paper we explore the case of weighted graphs.
Goldmakher, Leo, Khoury, Cap, Miller, Steven J., Ninsuwan, Kesinee   +3 more
core  

Equistarable graphs and counterexamples to three conjectures on equistable graphs

, 2014
Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight $1$.
Milanič, Martin, Trotignon, Nicolas
core  

Some bounds on the distance-sum-connectivity matrix. [PDF]

J Inequal Appl, 2018
Gök GK.
europepmc   +1 more source

Quasigroup associativity and biased expansion graphs

, 2006
T. Zaslavsky
semanticscholar   +1 more source

Elite Bernoulli-based mutated dung beetle algorithm for global complex problems and parameter estimation of solar photovoltaic models. [PDF]

Sci Rep
Elhosseny M, Abdel-Salam M, Nayyar A, Çelik E, Mahajan S, Bacanin N, El-Hasnony IM.   +6 more
europepmc   +1 more source

EDGE ODD GRACEFUL LABELING OF SOME FLOWER PETAL GRAPHS

, 2020
A labeling of a graph G with α vertices and β edges called an edge odd graceful labeling if there is an edge labeling with odd numbers to all edges such that each vertex is assigned a label which is the sum mod (2γ) of labels of edge incident on it ...
B. Ambika, G. Balasubramanian
semanticscholar   +1 more source

A Note on the Fundamental Groups and Covers of Lattice Walk

, 2014
G. Light
semanticscholar   +1 more source