Vertex graph theory - Open Access .click

Results 81 to 90 of about 206,170 (167)

MLRQ: an efficient labeling scheme for reachability queries on reduced DAGs

Journal of King Saud University: Computer and Information Sciences
Answering reachability queries is a fundamental operation in graph theory. Existing methods either build an index for partial reachability, which may lead to costly graph traversal during query processing, or construct an index for complete reachability,
Haiyan Zhang, Keng Hoon Gan, Shengping Yang +2 more
doaj +1 more source

A fuzzy graph theoretic approach to face shape recognition using cubic outerplanar structures. [PDF]

Sci Rep
Jaisankar D, Ramalingam S, Zegeye GB.
europepmc +1 more source

Zeta functions of quaternion weighted graphs (Research on algebraic combinatorics and representation theory of finite groups and vertex operator algebras)

Zeta functions of quaternion weighted graphs (Research on algebraic combinatorics and representation theory of finite groups and vertex operator algebras)
グラフのゼータ関数は, 伊原[6]により定義された伊原ゼータ関数が起源である. 伊原ゼータ関数は, PGL(2, mathbb{Q}_{p})の捻れのない余コンパクトな離散部分群rから定まるセルバーグゼータ関数の類似であり, 母関数型表示と行列式表示を持つことが[6]において示された. その後, Serre[15]により, 伊原ゼータ関数は, SL(2, mathbb{Q}_{p})に付随したBruhat-Tits tree(無限正則木)のrによる商グラフ(有限正則グラフ)のゼータ関数であることが示唆され, 砂田[17, 18]によってグラフのゼータ関数が確立された. その後多くの研究者の貢献により, グラフのゼータ関数は大きく発展した.
openaire

Simplex polynomial in complex networks and its applications to compute the Euler characteristic. [PDF]

Front Comput Neurosci
Wang Z, Fu X, Deng B, Chen Y, Zhao H.
europepmc +1 more source

Characterizing semi-directed phylogenetic networks and their multi-rootable variants. [PDF]