Results 121 to 130 of about 990 (211)
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
Dissociation in circulant graphs and integer distance graphs
Discussiones Mathematicae Graph TheorySummary: A dissociation set of a graph \(G\) is a set of vertices which induces a subgraph of \(G\) with maximum degree at most 1, or equivalently, a set of vertices whose complement in \(G\) is a 3-path vertex cover (intersecting every 3-path of \(G)\).
openaire +3 more sources
Family of Circulant Graphs and Its Expander Properties
, 2010 In this thesis, we apply spectral graph theory to show the non-existence of an expander family within the class of circulant graphs. Using the adjacency matrix and its properties, we prove Cheeger\u27s inequalities and determine when the equalities hold.
Nguyen, Vinh Kha Nguyen Tran
core +1 more source
Defensive alliances in regular graphs and circulant graphs [PDF]
, 2008 In this paper we study defensive alliances in some regular graphs. We determine which subgraphs could a critical defensive alliance of a graph $G$ induce, if $G$ is $6$-regular and the cardinality of the alliance is at most $8$.
Barrière Figueroa, Eulalia +1 more
core +1 more source
PMC-LABELING OF SOME CLASSES OF GRAPHS CONTAINING CYCLES
BarekengLet be a graph with p vertices and q edges. We have introduced a new graph labeling method using integers and cordial-related works and investigated some graphs for this labeling technique.
R Ponraj, S Prabhu, M Sivakumar
doaj +1 more source
Quantum LDPC Codes Based on Cocyclic Block Matrices. [PDF]
Entropy (Basel), 2023 Li Y, Guo Y.
europepmc +1 more source
On Edge Transitive Circulant Graphs
Tokyo Journal of Mathematics, 1996 This paper classifies those circulant graphs for which both the graph and its complement are edge-transitive. The author shows that such a graph must be either a disjoint union of copies of a complete graph, or the complement of such a disjoint union, or a Paley graph on a prime number of vertices.
openaire +3 more sources
Ring-Split: Deadlock-Free Routing Algorithm for Circulant Networks-on-Chip. [PDF]
Micromachines (Basel), 2023 Romanov AY +4 more
europepmc +1 more source
Quantum Coding via Quasi-Cyclic Block Matrix. [PDF]
Entropy (Basel), 2023 Li Y, Li JY.
europepmc +1 more source
The metric dimension of the circulant graph C(n,±{1,2,3,4})
, 2019 Let = (,) be a connected graph and let (,) denote the distance between vertices ,∈. A metric basis for is a set ⊆ of minimum cardinality such that no two vertices of have the same distances to all points of .
Kalinowski, Thomas +3 more
core