Results 61 to 70 of about 975,970 (227)
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
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
, 2015 We consider the number of spanning trees in circulant graphs of $\beta n$ vertices with generators depending linearly on $n$. The matrix tree theorem gives a closed formula of $\beta n$ factors, while we derive a formula of $\beta-1$ factors.
Louis, Justine
core +1 more source
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
Large circulant graphs of fixed diameter and arbitrary degree [PDF]
, 2017 We consider the degree-diameter problem for undirected and directed circulant graphs. To date, attempts to generate families of large circulant graphs of arbitrary degree for a given diameter have concentrated mainly on the diameter 2 case.
Bevan, David +2 more
core +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
Irregularity Strength of Circulant Graphs Using Algorithmic Approach
IEEE Access, 2021 This paper deals with decomposition of complete graphs on $n$ vertices into circulant graphs with reduced degree $r< n-1$ . They are denoted as $C_{n}(a_{1}, a_{2}, {\dots }, a_{m})$ , where $a_{1}$ to $a_{m}$ are generators.
M. Asim +4 more
semanticscholar +1 more source
International Journal of Cancer, Volume 158, Issue 10, Page 2771-2783, 15 May 2026.What's New? Circulating nuclear DNA (cir‐nDNA)‐based assessment of minimal residual disease (MRD) offers powerful post‐surgery prognostic insight for stage III colon cancer (CC). Sparse knowledge of post‐surgical variations and origins in cir‐nDNA, however, has limited its clinical application.
Andrei Kudriavtsev +17 more
wiley +1 more source