Results 11 to 20 of about 3,915 (163)

The Dilworth Number of Auto-Chordal-Bipartite Graphs [PDF]

, 2013
The mirror (or bipartite complement) mir(B) of a bipartite graph B=(X,Y,E) has the same color classes X and Y as B, and two vertices x in X and y in Y are adjacent in mir(B) if and only if xy is not in E. A bipartite graph is chordal bipartite if none of
Berry, Anne, Brandstädt, Andreas, Engel, Konrad   +2 more
core   +1 more source

Complexity of Hamiltonian Cycle Reconfiguration

Algorithms, 2018
The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles C 0 and C t of a graph G, whether there is a sequence of Hamiltonian cycles C 0 , C 1 , … , C t such that C i can be obtained ...
Asahi Takaoka
doaj   +1 more source

Strongly chordal and chordal bipartite graphs are sandwich monotone

Journal of Combinatorial Optimization, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heggernes, Pinar, Mancini, Federico, Papadopoulos, Charis, Sritharan, R.   +3 more
openaire   +3 more sources

Characterization of Super Strongly Perfect Graphs in Chordal and Strongly Chordal Graphs

Mapana - Journal of Sciences, 2012
A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H. In this paper, we have investigated the characterization of Super Strongly Perfect graphs using odd cycles.
R Mary Jeya Jothi, A Amutha
openaire   +2 more sources

Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs

Discrete Applied Mathematics, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uehara, Ryuhei, Toda, Seinosuke, Nagoya, Takayuki   +2 more
openaire   +1 more source

Strongly Unichord-Free Graphs

Discussiones Mathematicae Graph Theory, 2019
Several recent papers have investigated unichord-free graphs—the graphs in which no cycle has a unique chord. This paper proposes a concept of strongly unichord-free graph, defined by being unichord-free with no cycle of length 5 or more having exactly ...
McKee Terry A.
doaj   +1 more source

Markov models for fMRI correlation structure: is brain functional connectivity small world, or decomposable into networks? [PDF]

, 2012
Correlations in the signal observed via functional Magnetic Resonance Imaging (fMRI), are expected to reveal the interactions in the underlying neural populations through hemodynamic response.
A. Gramfort, Achard, Amaral, B. Thirion, Bassett, Beckmann, Bekinschtein, Bialonski, Bickel, Biswal, Bullmore, Calhoun, Chan, Chinn, Conturo, Cordes, Cuthill, Damoiseaux, Dawid, Dehaene, Dempster, Deuker, Eguiluz, Fair, Fair, Felleman, Finger, Fisher, Fox, Fox, Friedman, Friston, G. Varoquaux, Giudici, Goodale, Greicius, Gross, Hagmann, Humphries, Ioannides, J.B. Poline, Kiviniemi, Lauritzen, Le Bihan, Ledoit, Marlin, Marrelec, Papadimitriou, Raichle, Ramachandran, Robins, Rothman, Rütimann, Sadaghiani, Salvador, Seeley, Seeley, Shulman, Smith, Smith, Spirtes, Sporns, Sporns, Sporns, Stam, Stephan, Strogatz, Tononi, Tononi, Tzourio-Mazoyer, Van Den Heuvel, Varoquaux, Wang, Watts   +73 more
core   +7 more sources

A characterization of strongly chordal graphs

Discrete Mathematics, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dahlhaus, Elias, Manuel, Paul D., Miller, Mirka   +2 more
openaire   +2 more sources

Chordal- (k,ℓ)and strongly chordal- (k,ℓ)graph sandwich problems [PDF]

Journal of the Brazilian Computer Society, 2014
In this work, we consider the graph sandwich decision problem for property Π, introduced by Golumbic, Kaplan and Shamir: given two graphs G1=(V,E1) and G2=(V,E2), the question is to know whether there exists a graph G=(V,E) such that E1⊆E⊆E2 and G satisfies property Π. Particurlarly, we are interested in fully classifying the complexity of this problem
Couto, Fernanda, Faria, Luerbio, Klein, Sulamita   +2 more
openaire   +1 more source

Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs

Discrete Mathematics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources