Results 51 to 60 of about 410 (178)
Computing Exact Edge Geodetic Numbers in K‐Powered Path and Cycle Graphs
International Journal of Mathematics and Mathematical Sciences, Volume 2026, Issue 1, 2026.For any two vertices u and v in a graph G, u − v geodesic is the shortest path between u and v. A set S of vertices in G is called an edge geodetic cover for G if every edge in G belongs to a geodesic between two vertices of S. The minimum cardinality of an edge geodetic cover is called the edge geodetic number and is denoted by eg(G).
A. Baniabedalruhman +3 more
wiley +1 more source
Journal of Function Spaces, 2022 For applied scientists and engineers, graph theory is a strong and vital tool for evaluating and inventing solutions for a variety of issues. Graph theory is extremely important in complex systems, particularly in computer science.
A. El-Mesady, Omar Bazighifan
doaj +1 more source
Products of Circulant Graphs Are Metacirculant
Journal of Combinatorial Theory, Series B, 2002 Broere and Hattingh studied \(B\)-products of graphs (introduced by Imrich and Izbicki) and proved that the lexicographic product of two circulant graphs is again circulant, but this is not the case with other products. In the present paper any \(B\)-product of two circulant graphs is proved to be a metacirculant graph with parameters that are easily ...
openaire +1 more source
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
On Distinct Inertias of Lanzhou Matrices Versus Adjacency Matrices in Some Graph Classes
Journal of Mathematics, Volume 2026, Issue 1, 2026.The Lanzhou matrix is a recently introduced graph matrix that depends on the adjacency relation and on the degrees of each vertex in the graph and its complement, thereby providing a spectral perspective on graph structure that differs from the classical adjacency matrix.
Madhumitha K. V. +4 more
wiley +1 more source
A Class of Koszul Algebra and Some Homological Invariants through Circulant Matrices and Cycles
Journal of Mathematics, 2022 Recent advances in graph theory, linear algebra, and commutative algebra render us to tackle problems in one bough of mathematics with assistance and guidance from others.
Muhammed Nadeem +5 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
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 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
Spectral analysis of the wreath product of a complete graph with a cocktail party graph
Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, 2018 Graph products and the corresponding spectra are often studied in the literature. A special attention has been given to the wreath product of two graphs, which is derived from the homonymous product of groups.
Francesco Belardo +2 more
doaj +1 more source