Results 1 to 10 of about 5,608,609 (280)
Restrained Domination in Self-Complementary Graphs [PDF]
Discussiones Mathematicae Graph Theory, 2021 A self-complementary graph is a graph isomorphic to its complement. A set S of vertices in a graph G is a restrained dominating set if every vertex in V(G) \ S is adjacent to a vertex in S and to a vertex in V(G) \ S.
Desormeaux Wyatt J. +2 more
doaj +7 more sources
Self-complementary graphs and Ramsey numbers Part I: the decomposition and construction of self-complementary graphs [PDF]
Discrete Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jin Xu, C. K. Wong
exaly +5 more sources
On almost self-complementary graphs
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Primoz Potocnik, Mateja Sajna
exaly +2 more sources
Local coloring of self complementary graphs
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a graph. A local coloring of a graph of order at least 2 is a function having the property that for each set with , there exist vertices such that , where is the size of the induced subgraph .
P. Deepa +2 more
doaj +2 more sources
Explainable Superpixel-Guided Graph Vision Transformer for Hyperspectral Image Analysis [PDF]
SensorsHyperspectral imaging provides rich spectral–spatial information for fine-grained material discrimination, but effective and interpretable modeling remains challenging because land-cover regions often have irregular spatial structures and class-specific ...
Jieli Chen +4 more
doaj +2 more sources
On separable self-complementary graphs
Discrete Mathematics, 2002 The authors consider simple finite undirected graphs. Their first result is a set of necessary and sufficient conditions for the complement \(\overline G\) of a separable graph \(G\) to be separable or disconnected. If \(H\) is a graph and \(P_4=v_1v_2v_3v_4\) is a 4-path, then the graph \(G\) obtained from \(H\cup P_4\) by joining \(v_2\) and \(v_3 ...
Atsuhiro Nakamoto +2 more
exaly +4 more sources
Homogeneously almost self-complementary graphs [PDF]
Electronic Notes in Discrete Mathematics, 2005 Abstract We give necessary and sufficient conditions on n for there to exist a homogeneously almost self-complementary graph of order 2 n for the cases when n is an odd prime power, and when n is twice a prime. We introduce a unified approach to almost self-complementary graphs via brick assignments, and use it to construct several important ...
Primoz Potocnik, Mateja Sajna
exaly +3 more sources
On the structure of self-complementary graphs [PDF]
Electronic Notes in Discrete Mathematics, 2005 A \emph{self-complementary} graph is a graph isomorphic to its complement. An isomorphism between $G$ and its complement, viewed as a permutation of $V(G)$, is then called an \emph{antimorphism}. A \emph{skew partition} of $G$ is a partition of $V(G)$ into 4 sets $A,B,C,D$ such that there is no edge between $A,B$ and every possible edge between $C,D ...
exaly +4 more sources
scGSI: Graph-guided self-supervised integration of paired single-cell multi-omics. [PDF]
PLoS Computational BiologyPaired single-cell multi-omics technologies provide direct within-cell correspondence across molecular layers and offer a powerful route to dissecting cellular heterogeneity and regulatory relationships.
Xiang Chen +4 more
doaj +2 more sources
Characterisation of self-complementary chordal graphs
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. R. Sridharan, K. Balaji
exaly +3 more sources