Results 91 to 100 of about 720,784 (299)

Distance-Regular Graphs and Halved Graphs

European Journal of Combinatorics, 1986
Let G be a bipartite distance-regular graph with bipartition \(V(G)=X\cup Y\). Let \(V(G')=X\) and, for x and y in X, let x be adjacent to y in G' if and only if x is of distance two from y in G. Then G' is called a halved graph of G, and is distance-regular. This paper discusses whether G' is one of the known, large-diameter, distance-regular graphs.
openaire   +3 more sources

Distance-Regular Graphs

The Electronic Journal of Combinatorics, 2016
This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN' [Brouwer, A.E., Cohen, A.M., Neumaier, A., Distance-Regular Graphs, Springer-Verlag, Berlin,
Edwin R. van Dam, Jack H. Koolen, Hajime Tanaka   +2 more
openaire   +4 more sources

Electrically Tunable Graphene‐Metal Hybrid Metasurfaces for High‐Efficiency, Broadband Mid‐Infrared Transmission Modulation

Advanced Science, EarlyView.
A graphene‐metal hybrid transmissive metasurface enables electrically tunable mid‐infrared transmission modulation through ionic gel top gating. By combining graphene with a metallic slit metasurface, high modulation efficiency and broadband operation are achieved simultaneously, demonstrating efficient electrical control of mid‐infrared transmission ...
Heonhak Ha, Jinseok Kong, Junhyung Kim, Jiwon Kang, Min Seok Jang   +4 more
wiley   +1 more source

On clique graphs and clique regular graphs

Discrete Mathematics
If $Γ$ is a graph for which every edge is in exactly one clique of order $ω$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $Γ$. We discover many general results and classifications related to these clique graph that will be useful to researchers studying these objects. In particular,
Robert R. Petro, Connor M. Phillips
openaire   +3 more sources

scGEN: Leveraging an Adaptive Weighting Strategy for Challenging Cell Clustering in Single‐Cell RNA‐seq

Advanced Science, EarlyView.
scGEN combines attribute–structure encoding, adaptive hard‐sample weighting, and regularized zero‐inflated negative binomial loss to resolve ambiguous single‐cell states. In the developing human pituitary, refined annotations reveal Pre.Gonado cells at 7 weeks and previously obscured developmental communication networks.
Fang Huang, Dayu Hu, Yaqi Dai, Aoyi Geng, Renxiang Guan, Hao Quan, Brett A. McGregor, Zhihan Wang, Nadeem Khan, Hongsheng Zhang, Jinghua Zhang, Mingyang Xia, Xiaoqiong Gu, Di Che, Junguk Hur, Xiaoyu Cui, Kai Guo   +16 more
wiley   +1 more source

Non-local Graph-Based Regularization for Deformable Image Registration [PDF]

, 2017
Deformable image registration aims to deliver a plausible spatial transformation between two or more images by solving a highly dimensional, ill-posed optimization problem. Covering the complexity of physiological motion has so far been limited to either
Papież, BW, Szmul, A, Grau, V, Schnabel, JA, J. Michael Brady, Adam Szmul, Vicente Grau, Julia A. Schnabel, Bartłomiej W. Papież, Brady, John   +9 more
core   +2 more sources

Matchings in regular graphs

Discrete Mathematics, 1981
AbstractWe consider k-regular graphs with specified edge connectivity and show how some classical theorems and some new results concerning the existence of matchings in such graphs can be proved by using the polyhedral characterization of Edmonds.
Denis Naddef, William R. Pulleyblank
openaire   +1 more source

Graph and Manifold Co-Regularization

, 2013
Classical foundations of Statistical Learning Theory rely on the assumption that the input patterns are independently and identically distributed. However, in many applications, the inputs, represented as feature vectors, are also embedded into a network
Saccà, Claudio, Gori, Marco, Diligenti, Michelangelo, Marco Gori, Claudio Sacca, Michelangelo Diligenti   +5 more
core   +1 more source

A Facial Foundation Model for Clinical Biomarker Prediction and Real‐World Mobile Deployment

Advanced Science, EarlyView.
MedicalFaceFound is a facial foundation model developed through three‐stage progressive pre‐training, adapting representations from general vision to facial structure and clinical phenotypes. Using a single facial image, it estimates 62 biomarkers across multiple physiological systems and supports downstream risk prediction for cardiovascular ...
Tingfeng Xu, Huixuan Xu, Li Lin, Fei Wang, Yaodong Ding, Shuangqiao Liao, Xingyu Chen, Jichen Wen, Hongqiang Zhao, Jing Hao, Weixiang Zhao, Gong Zhang, Shiguang Shan, Yong Zeng, Hu Han, Minxian Wang   +15 more
wiley   +1 more source

Distance regular graphs of diameter 3 and strongly regular graphs

Discrete Mathematics, 1984
In a paper by \textit{N. L. Biggs} [Ann. Discrete Math. 15, 69-80 (1982; Zbl 0506.05057)], two parameter sets for distance regular graphs that are antipodal covers of a complete graph were mentioned for which the existence of a corresponding graph was unknown.
openaire   +4 more sources