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
Algebraic invariants of the edge ideals of whisker graphs of cubic circulant graphs. [PDF]
Afridi MUK, Rehman IU, Ishaq M.
europepmc +1 more source
Exact and parameterized algorithms for choosability. [PDF]
Bliznets I, Nederlof J.
europepmc +1 more source
NAP: The Network Analysis Profiler, a web tool for easier topological analysis and comparison of medium-scale biological networks. [PDF]
Theodosiou T +6 more
europepmc +1 more source
Acyclic and star coloring parameters of fractal cubic networks. [PDF]
Renuga C +3 more
europepmc +1 more source
Reconfiguring Shortest Paths in Graphs. [PDF]
Gajjar K, Jha AV, Kumar M, Lahiri A.
europepmc +1 more source
Single-cell 3D genome reconstruction in the haploid setting using rigidity theory. [PDF]
Dewar S +4 more
europepmc +1 more source
Doubly Nonnegative and Semidefinite Relaxations for the Densest k-Subgraph Problem. [PDF]
Guo CH, Guo Y, Liu BB.
europepmc +1 more source
DHGT-DTI: Advancing drug-target interaction prediction through a dual-view heterogeneous network with GraphSAGE and Graph Transformer. [PDF]
Wang M, Lei X, Guo L, Chen M, Pan Y.
europepmc +1 more source

