Results 111 to 120 of about 453 (193)

On the Complexity of Finding a Sun in a Graph

, 2010
The sun is the graph obtained from a cycle of length even and at least six by adding edges to make the even-indexed vertices pairwise adjacent. Suns play an important role in the study of strongly chordal graphs. A graph is chordal if it does not contain
Hoàng, Chính T.
core  

Spanning Tree Problems on Graph Classes

, 2007
生成樹 (spanning tree) 問題在計算機科學上，不僅是演算法領域的一個重要課題，同時也具有許多實務上的應用。例如通訊網路設計、圖形編碼以及傳輸路徑設計。根據不同的應用需求，所產生的生成樹問題也不同。最為人所知的生成樹問題為最小成本生成樹 (minimum cost spanning tree) 以及最短路徑生成樹 (shortest path tree)。這兩個問題都是古典的生成樹問題，且均可在多項式時間內被解決。然而，並不是所有生成樹問題都是容易解決的。例如斯坦納最小成本樹(Steiner
林清池, Lin, Ching-Chi
core  

Strongly chordal graphs as intersection graphs of trees (Farber's proof revisited)

CoRR
In his Ph.D. thesis, Farber proved that every strongly chordal graph can be represented as intersection graph of subtrees of a weighted tree, and these subtrees are ``compatible''. Moreover, this is an equivalent characterization of strongly chordal graphs. To my knowledge, Farber never published his results in a conference or a journal, and the thesis
openaire   +2 more sources

Algebraic invariants of the edge ideals of whisker graphs of cubic circulant graphs. [PDF]

Heliyon
Afridi MUK, Rehman IU, Ishaq M.
europepmc   +1 more source

Optimal Designs for Discrete Choice Models Via Graph Laplacians. [PDF]

J Stat Theory Pract
Röttger F, Kahle T, Schwabe R.
europepmc   +1 more source

Identification of STAT3 and BIRC5 as anoikis-related biomarkers in psoriasis. [PDF]

Sci Rep
Bai W, Wang K, Wu S, Zhou X, Liu L, Liu M, Chen C.   +6 more
europepmc   +1 more source

Poster Sessions

HemaSphere, Volume 10, Issue S1, June 2026.
wiley   +1 more source

Music and awe: complex emotions evoked by tonal dissonance. [PDF]

Front Psychol
Wilson S, Braaten RF, Coluzzi SJ.
europepmc   +1 more source

Identification of ferroptosis-related key genes in tuberculosis by bioinformatics methods. [PDF]

AMB Express
Zhang W, Zhu D, Jiang H, Wang L.
europepmc   +1 more source

Graph Isomorphism Completeness for Chordal Bipartite Graphs and Strongly Chordal Graphs

Graph Isomorphism Completeness for Chordal Bipartite Graphs and Strongly Chordal Graphs
This paper deal with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chrdal graphs. It is known that GI problem is GI complete for some special graph classes including regular graphs, bipartite graphs, chordal graphs, comparability graphs, split graphs, and k-trees for unbounded k.
openaire