Results 71 to 80 of about 428,321 (154)
Characterizing k-chordal unichord-free graphs
, 2018 The [Formula: see text]-chordal graphs, defined by no induced cycle having length greater than [Formula: see text], generalize the traditional chordal graphs (where [Formula: see text]), which Dirac characterized in 1961 by minimal separators always ...
Terry A. McKee
core +1 more source
On an edge partition and root graphs of some classes of line graphs
Electronic Journal of Graph Theory and Applications, 2017 The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line ...
K Pravas, A. Vijayakumar
doaj +1 more source
Graph Isomorphism Completeness for Chordal bipartite graphs and Strongly Chordal Graphs
, 2004 This paper deals with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chordal graphs. It is known that GI problem is GI complete even for some special graph classes including regular graphs, bipartite ...
Ryuhei Uehara, et al.
core
The 0-1 inverse maximum stable set problem [PDF]
Given an instance of a weighted combinatorial optimization problem and its feasible solution, the usual inverse problem is to modify as little as possible (with respect to a fixed norm) the given weight system to make the giiven feasible solution optimal.
Yerim Chung, Marc Demange
core
Chordal Bipartite Graphs with High Boxicity
, 2011 The boxicity of a graph G is defined as the minimum integer k such that G is an intersection graph of axis-parallel k-dimensional boxes. Chordal bipartite graphs are bipartite graphs that do not contain an induced cycle of length greater than 4.
Chandran, Sunil L +2 more
core
Structural and Spectral Properties of Chordal Ring, Multi-Ring, and Mixed Graphs
The chordal ring (CR) graphs are a well-known family of graphs used to model some interconnection networks for computer systems in which all nodes are in a cycle. Generalizing the CR graphs, in this paper, we introduce the families of chordal multi-ring (
M. A. Reyes +5 more
core +1 more source
Bipartite Powers of k-chordal Graphs
, 2013 Let k be an integer and k ≥ 3. A graph G is k-chordal if G does not have an induced cycle of length greater than k. From the definition it is clear that 3-chordal graphs are precisely the class of chordal graphs.
Chandran, Sunil, L. +3 more
core +1 more source
Component graphs of vector spaces and zero-divisor graphs of ordered sets
AKCE International Journal of Graphs and CombinatoricsIn this paper, nonzero component graphs and nonzero component union graphs of finite-dimensional vector spaces are studied using the zero-divisor graph of a specially constructed 0–1-distributive lattice and the zero-divisor graph of rings.
Nilesh Khandekar +2 more
doaj +1 more source
Chordal Probe Graphs (Extended Abstract)
, 2008 In this paper, we introduce the class of chordal probe graphs which are a generalization of both interval probe graphs and chordal graphs. A graph G is chordal probe if its vertices can be partitioned into two sets P (probes) and N (non-probes) where N ...
Martin Charles +2 more
core
Efficient Minus and Signed Domination in Proper Interval Graphs with a Totally Unimodular Structure
AxiomsThe efficient minus domination problem (EMDP) and the efficient signed domination problem (ESDP) are domination-type problems in graphs. These problems are known to be NP-complete on chordal graphs and polynomially solvable on chain interval graphs ...
Chuan-Min Lee
doaj +1 more source