Results 81 to 90 of about 975,970 (227)
Distance antimagic labeling of circulant graphs
AIMS MathematicsA distance antimagic labeling of graph $ G = (V, E) $ of order $ n $ is a bijection $ f:V(G)\rightarrow \{1, 2, \ldots, n\} $ with the property that any two distinct vertices $ x $ and $ y $ satisfy $ \omega(x)\ne\omega(y) $, where $ \omega(x) $ denotes ...
Syafrizal Sy +4 more
semanticscholar +1 more source
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
Journal of Combinatorial Theory, Series B, 1980 AbstractAn algebraic characterization is given for those Cayley graphs for cyclic groups in which the neighborhood of any vertex is a cycle. A triangular imbedding is obtained for each such graph, either in the sphere, the torus, or the Klein bottle.
openaire +2 more sources
Broader families of cordial graphs
Indonesian Journal of Combinatorics, 2021 A binary labeling of the vertices of a graph G is cordial if the number of vertices labeled 0 and the number of vertices labeled 1 differ by at most 1, and the number of edges of weight 0 and the number of edges of weight 1 differ by at most 1.
Christian Barrientos, Sarah Minion
doaj +1 more source
Minimal chordal sense of direction and circulant graphs
, 2005 A sense of direction is an edge labeling on graphs that follows a globally consistent scheme and is known to considerably reduce the complexity of several distributed problems. In this paper, we study a particular instance of sense of direction, called a
A. Ádám +15 more
core +2 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
Some identities for enumerators of circulant graphs
, 2001 We establish analytically several new identities connecting enumerators of different types of circulant graphs of prime, twice prime and prime-squared orders.
Liskovets, Valery A.
core +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
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