Results 41 to 50 of about 8,162 (190)
The minimum rank problem for circulants
, 2015 The minimum rank problem is to determine for a graph $G$ the smallest rank of a Hermitian (or real symmetric) matrix whose off-diagonal zero-nonzero pattern is that of the adjacency matrix of $G$.
Deaett, Louis, Meyer, Seth A.
core +1 more source
On Adjacency Metric Dimension of Some Families of Graph
Journal of Function Spaces, 2022 Metric dimension of a graph is a well-studied concept. Recently, adjacency metric dimension of graph has been introduced. A set Qa⊂VG is considered to be an adjacency metric generator for G if u1,u2∈V\Qa (supposing each pair); there must exist a vertex q∈
Ali N. A. Koam +4 more
doaj +1 more source
Sampling and Reconstruction of Sparse Signals on Circulant Graphs - An Introduction to Graph-FRI
, 2017 With the objective of employing graphs toward a more generalized theory of signal processing, we present a novel sampling framework for (wavelet-)sparse signals defined on circulant graphs which extends basic properties of Finite Rate of Innovation (FRI)
Dragotti, Pier Luigi +1 more
core +1 more source
Macroscopic Network Circulation for Planar Graphs
IEEE Transactions on Control of Network Systems, 2022 The analysis of networks, aimed at suitably defined functionality, often focuses on partitions into subnetworks that capture desired features. Chief among the relevant concepts is a 2-partition, that underlies the classical Cheeger inequality, and highlights a constriction (bottleneck) that limits accessibility between the respective parts of the ...
Fariba Ariaei +3 more
openaire +3 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
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
The irregularity strength of circulant graphs
Discrete Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baril, Jean-Luc +2 more
openaire +2 more sources
Discrete Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brown, Jason, Hoshino, Richard
openaire +2 more sources
Perfect matching transitivity of circulant graphs.
Electronic Journal of Graph Theory and Applications, 2022 Summary: A graph \(G\) is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings \(M_1\) and \(M_2\) of \(G\), there is an automorphism \(f : V(G)\mapsto V(G)\) such that \(f_e (M_1)=M_2\), where \(f_e(uv)=f(u)f(v)\). In this paper, the authors completely characterize the perfect matching transitivity of circulant graphs ...
Reiter, Isaac Armando, Zhou, Ju
openaire +2 more sources