Results 91 to 100 of about 51,213 (189)

Graph Isomorphism Completeness for Chordal Bipartite Graphs and Strongly Chordal Graphs

open access: yesGraph 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  

Mutual transferability for (F, B, R)-domination on strongly chordal graphs and cactus graphs

open access: yesDiscrete Applied Mathematics, 2019
Kuan-Ting Chu   +2 more
semanticscholar   +1 more source

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

open access: yesJ Stat Theory Pract
Röttger F, Kahle T, Schwabe R.
europepmc   +1 more source

Home - About - Disclaimer - Privacy