Results 41 to 50 of about 8,142 (196)
Typical circulant double coverings of a circulant graph
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feng, RQ, Kwak, JH
openaire +3 more sources
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
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
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
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
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
β3‐adrenoceptor agonism exerts lung protection in a rat model of bronchopulmonary dysplasia
British Journal of Pharmacology, EarlyView.The β3‐adrenoceptors agonist BRL37344 promotes lung maturation, preventing the progression of experimental bronchopulmonary dysplasia. Absract Background and Purpose Bronchopulmonary dysplasia (BPD) affects premature newborns, particularly those receiving supplemental oxygen therapy.
Alessandro Pini +14 more
wiley +1 more source