Results 61 to 70 of about 332 (178)
The Pfaffian property of circulant graphs
Discrete Applied Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fuliang Lu, Lianzhu Zhang, Yan Wang
openaire +2 more sources
Algebraic Connectivity Maximizing Regular Graphs: Special Case Analysis and Depth‐First Search
Concurrency and Computation: Practice and Experience, Volume 37, Issue 27-28, 25 December 2025.ABSTRACT The algebraic connectivity is an indicator of how well connected a graph is. It also characterizes the convergence speed of some dynamic processes over networks. In this paper, taking into account that homogeneous networks are modeled as regular graphs, we tackle the following problem: given a pair (n,k)$$ \left(n,k\right) $$ of positive ...
Masashi Kurahashi +3 more
wiley +1 more source
Restricted triangulation on circulant graphs
Open Mathematics, 2018 The restricted triangulation existence problem on a given graph decides whether there exists a triangulation on the graph’s vertex set that is restricted with respect to its edge set. Let G = C(n, S) be a circulant graph on n vertices with jump value set
Ali Niran Abbas +2 more
doaj +1 more source
Perfect codes in circulant graphs
Discrete Mathematics, 2017 A perfect code in a graph $Γ= (V, E)$ is a subset $C$ of $V$ that is an independent set such that every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A total perfect code in $Γ$ is a subset $C$ of $V$ such that every vertex of $V$ is adjacent to exactly one vertex in $C$. A perfect code in the Hamming graph $H(n, q)$ agrees with a
Rongquan Feng, He Huang, Sanming Zhou
openaire +3 more sources
Journal of Combinatorial Designs, Volume 33, Issue 10, Page 379-387, October 2025.ABSTRACT The E ( s 2 )‐optimal and minimax‐optimal supersaturated designs (SSDs) with 12 rows, 11 q columns, and s max = 4 are enumerated in a computer search: there are, respectively, 34, 146, 0, 3, and 1 such designs for q = 2 , 3 , 4 , 5, and 6. Cheng and Tang proved that for q > 6, there are no such SSDs.
Luis B. Morales
wiley +1 more source
Irreversible k-Threshold Conversion Number of Circulant Graphs
Journal of Applied Mathematics, 2022 An irreversible conversion process is a dynamic process on a graph where a one-way change of state (from state 0 to state 1) is applied on the vertices if they satisfy a conversion rule that is determined at the beginning of the study. The irreversible k-
Ramy Shaheen, Suhail Mahfud, Ali Kassem
doaj +1 more source
Procedural Multiscale Geometry Modeling using Implicit Surfaces
Computer Graphics Forum, Volume 44, Issue 7, October 2025.Abstract Materials exhibit geometric structures across mesoscopic to microscopic scales, influencing macroscale properties such as appearance, mechanical strength, and thermal behavior. Capturing and modeling these multiscale structures is challenging but essential for computer graphics, engineering, and materials science.
Bojja Venu +2 more
wiley +1 more source
L(2, 1)-Labeling of Circulant Graphs
Discussiones Mathematicae Graph Theory, 2019 An L(2, 1)-labeling of a graph Γ is an assignment of non-negative integers to the vertices such that adjacent vertices receive labels that differ by at least 2, and those at a distance of two receive labels that differ by at least one.
Mitra Sarbari, Bhoumik Soumya
doaj +1 more source
Discrete Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jason I. Brown, Richard Hoshino
openaire +2 more sources
The Directed Oberwolfach Problem With Variable Cycle Lengths: A Recursive Construction
Journal of Combinatorial Designs, Volume 33, Issue 7, Page 239-260, July 2025.ABSTRACT The directed Oberwolfach problem OP * ( m 1 , … , m k ) asks whether the complete symmetric digraph K n *, assuming n = m 1 + ⋯ + m k, admits a decomposition into spanning subdigraphs, each a disjoint union of k directed cycles of lengths m 1 , … , m k.
Suzan Kadri, Mateja Šajna
wiley +1 more source