Almost self-complementary circulant graphs [PDF]
Discrete Mathematics, 2004 The concept of an {almost self-complementary graph} has been introduced by B. Alspach to get around the restriction that the order of a self-complementary regular graph must be odd. An {almost complement} of a graph \(\Gamma\) of even order is a graph obtained by removing the edges of a 1-factor from the complement of \( \Gamma \).
Mateja Sajna, Edward Dobson
exaly +3 more sources
More on almost self-complementary graphs [PDF]
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mateja Sajna
exaly +3 more sources
Coloring edges of self-complementary graphs [PDF]
Discrete Applied Mathematics, 1997 According to the well-known Vizing theorem a graph \(G\) is said to be Class 1 (Class 2) if the chromatic index of \(G\) equals \(h (h+1)\), where \(h\) is the maximum vertex degree of \(G\). The authors show: (i) if a self-complementary graph \(G\) has a complementing permutation that is a cycle, then \(G\) is Class 1, and (ii) every regular self ...
A. Pawel Wojda, Malgorzata Zwonek
exaly +4 more sources
A note on the colour class of a self-complementary graph [PDF]
Discrete Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wojda, A.Paweł
exaly +3 more sources
Construction of self-complementary graphs [PDF]
Discrete Mathematics, 1997 Given a fixed graph \(H\) of order \(2p\), a necessary and sufficient condition is presented for the existence of a self-complementary graph \(G\) of order \(4p\) that contains vertex disjoint copies of \(H\) and \(\overline{H}\), the complement of \(H\).
Nair, P.S.
openaire +3 more sources
Self-complementary two-graphs and almost self-complementary double covers [PDF]
European Journal of Combinatorics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Primoz Potocnik, Mateja Sajna
openaire +2 more sources
Multi-Perspective Spatio-Temporal Feature Fusion Model for Urban Traffic Flow Prediction [PDF]
SensorsUrban traffic flow is difficult to forecast accurately because its evolution is non-linear and governed by dependencies that operate over different spatial and temporal ranges.
Avazjon Marakhimov +5 more
doaj +2 more sources
Graph guided multiscale cross attention for multilabel chest X ray classification [PDF]
Scientific ReportsMulti-label chest X-ray (CXR) classification is challenging because thoracic abnormalities vary substantially in scale, visual saliency, and anatomical distribution, while disease labels often exhibit clinically meaningful dependencies.
Guokun Shi +6 more
doaj +2 more sources
Resting‐State EEG Functional Connectivity in Young Adults With Clinically Diagnosed Generalized Anxiety Disorder and Self‐Reported Habitual Short Sleep: An Alpha‐Band Network Analysis [PDF]
Brain and BehaviorBackground Generalized anxiety disorder (GAD) is commonly accompanied by sleep disturbance in young adults. Whether clinically diagnosed GAD with self‐reported habitual short sleep (HSS) is associated with altered resting‐state large‐scale functional ...
Ce Shi +14 more
doaj +2 more sources
On self-complementary supergraphs of (n, n)-graphs
Electronic Notes in Discrete Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. Pawel Wojda +2 more
exaly +4 more sources