Results 41 to 50 of about 6,790 (196)
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
Eccentricity-Based Topological Invariants of Some Chemical Graphs
Atoms, 2019 Topological index is an invariant of molecular graphs which correlates the structure with different physical and chemical invariants of the compound like boiling point, chemical reactivity, stability, Kovat’s constant etc.
Nazeran Idrees +2 more
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
On cyclic orthogonal double covers of circulant graphs by special infinite graphs
AKCE International Journal of Graphs and Combinatorics, 2017 In this article, a technique to construct cyclic orthogonal double covers (CODCs) of regular circulant graphs by certain infinite graph classes such as complete bipartite and tripartite graphs and disjoint union of butterfly and is introduced.
R. El-Shanawany, A. El-Mesady
doaj +1 more source
Fault-Tolerant Metric Dimension of Circulant Graphs
Mathematics, 2022 Let G be a connected graph with vertex set V(G) and d(u,v) be the distance between the vertices u and v. A set of vertices S={s1,s2,…,sk}⊂V(G) is called a resolving set for G if, for any two distinct vertices u,v∈V(G), there is a vertex si∈S such that d ...
Laxman Saha +4 more
doaj +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
Supermagic Generalized Double Graphs 1
Discussiones Mathematicae Graph Theory, 2016 A graph G is called supermagic if it admits a labelling of the edges by pairwise di erent consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex.
Ivančo Jaroslav
doaj +1 more source