Results 41 to 50 of about 1,340 (226)
Perfect Matchings in Random Octagonal Chain Graphs
Journal of Mathematics, Volume 2021, Issue 1, 2021., 2021 A perfect matching of a (molecule) graph G is a set of independent edges covering all vertices in G. In this paper, we establish a simple formula for the expected value of the number of perfect matchings in random octagonal chain graphs and present the asymptotic behavior of the expectation.
Shouliu Wei +5 more
wiley +1 more source
Journal of Mathematics, Volume 2021, Issue 1, 2021., 2021 The normalized Laplacian plays an indispensable role in exploring the structural properties of irregular graphs. Let Ln8,4 represent a linear octagonal‐quadrilateral network. Then, by identifying the opposite lateral edges of Ln8,4, we get the corresponding Möbius graph MQn(8,4). In this paper, starting from the decomposition theorem of polynomials, we
Jia-Bao Liu +3 more
wiley +1 more source
Tiling a Pyramidal Polycube with Dominoes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 The notion of pyramidal polycubes, namely the piling-up of bricks of a non-increasing size, generalizes in R^n the concept of trapezoidal polyominoes. In the present paper, we prove that n-dimensional dominoes can tile a pyramidal polycube if and only if
Olivier Bodini, Damien Jamet
doaj +1 more source
Polynomials and General Degree‐Based Topological Indices of Generalized Sierpinski Networks
Complexity, Volume 2021, Issue 1, 2021., 2021 Sierpinski networks are networks of fractal nature having several applications in computer science, music, chemistry, and mathematics. These networks are commonly used in chaos, fractals, recursive sequences, and complex systems. In this article, we compute various connectivity polynomials such as M‐polynomial, Zagreb polynomials, and forgotten ...
Chengmei Fan +5 more
wiley +1 more source
Indecomposability: polyominoes and polyomino tilings
The Mathematical Gazette, 2008 When we were preparing our earlier article [1], we thought to look back to see what else had appeared in the Gazette on the subject of polyominoes. A polyomino is a finite collection of cells in the square grid with connected interior - so it is insufficient that cells be connected only corner to corner.
Rinaldi, Simone, Rogers, D. G.
openaire +2 more sources
Periodic parallelogram polyominoes [PDF]
Electronic Notes in Discrete Mathematics, 2017 9 pages, 6 figures, GASCOM ...
Adrien Boussicault +1 more
openaire +2 more sources
Comparison of the Wiener and Kirchhoff Indices of Random Pentachains
Journal of Mathematics, Volume 2021, Issue 1, 2021., 2021 Let G be a connected (molecule) graph. The Wiener index W(G) and Kirchhoff index Kf(G) of G are defined as the sum of distances and the resistance distances between all unordered pairs of vertices in G, respectively. In this paper, explicit formulae for the expected values of the Wiener and Kirchhoff indices of random pentachains are derived by the ...
Shouliu Wei +4 more
wiley +1 more source
The number of $k$-parallelogram polyominoes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 A convex polyomino is $k$-$\textit{convex}$ if every pair of its cells can be connected by means of a $\textit{monotone path}$, internal to the polyomino, and having at most $k$ changes of direction.
Daniela Battaglino +3 more
doaj +1 more source
A Size‐Perimeter Discrete Growth Model for Percolation Clusters
Complexity, Volume 2021, Issue 1, 2021., 2021 Cluster growth models are utilized for a wide range of scientific and engineering applications, including modeling epidemics and the dynamics of liquid propagation in porous media. Invasion percolation is a stochastic branching process in which a network of sites is getting occupied that leads to the formation of clusters (group of interconnected ...
Bendegúz Dezső Bak +2 more
wiley +1 more source
The Estimation of the Number of Lattice Tilings of a Plane by a Given Area Polyomino
Моделирование и анализ информационных систем, 2013 We study a problem of a number of lattice plane tilings by given area polyominoes. A polyomino is a connected plane geometric figure formed by joining edge to edge a finite number of unit squares.
A. V. Shutov, E. V. Kolomeykina
doaj +3 more sources