Journal of the Brazilian Computer Society, ISSN 01046500, 12/2014, Volume 20, Issue 1, pp. 1  10
...⊆E
2 and G satisfies property Π. Particurlarly, we are interested in fully classifying the complexity of this problem when we look to the following properties Π: ‘G is a chordal (k,ℓ)graph...
Graph sandwich problem  Chordal–( k , ℓ )graph  Data Structures  Computer Science  Simulation and Modeling  Computer Science, general  Strongly chordal–( k , ℓ )graph  Computer System Implementation  Operating Systems  Strongly chordal–(k,ℓ)graph  Chordal–(k,ℓ)graph  Sandwiches  Algorithms
Graph sandwich problem  Chordal–( k , ℓ )graph  Data Structures  Computer Science  Simulation and Modeling  Computer Science, general  Strongly chordal–( k , ℓ )graph  Computer System Implementation  Operating Systems  Strongly chordal–(k,ℓ)graph  Chordal–(k,ℓ)graph  Sandwiches  Algorithms
Journal Article
Journal of combinatorial optimization, ISSN 15732886, 2012, Volume 26, Issue 3, pp. 608  619
Given real numbers b≥a>0, an (a,b)Roman dominating function of a graph
G=(V,E) is a function f:V→{0,a,b} such that every vertex v with f...
Mathematics  Theory of Computation  Optimization  Domination  Split graphs  Convex and Discrete Geometry  Operations Research/Decision Theory  Roman domination  Mathematical Modeling and Industrial Mathematics  Strongly chordal graphs  Combinatorics  Bipartite graphs  Chordal graphs  MATHEMATICS, APPLIED  COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS  EMPIRE  STRATEGY  INDEPENDENT DOMINATION  Algorithms
Mathematics  Theory of Computation  Optimization  Domination  Split graphs  Convex and Discrete Geometry  Operations Research/Decision Theory  Roman domination  Mathematical Modeling and Industrial Mathematics  Strongly chordal graphs  Combinatorics  Bipartite graphs  Chordal graphs  MATHEMATICS, APPLIED  COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS  EMPIRE  STRATEGY  INDEPENDENT DOMINATION  Algorithms
Journal Article
Journal of Combinatorial Optimization, ISSN 13826905, 10/2011, Volume 22, Issue 3, pp. 438  456
.... In this paper we show that strongly chordal graphs and chordal bipartite graphs are sandwich monotone, answering an open question by Bakonyi and Bono (Czechoslov. Math. J. 46:577–583, 1997...
Chordal bipartite graphs  Sandwich monotonicity  Operations Research/Decision Theory  Convex and Discrete Geometry  Mathematics  Theory of Computation  Mathematical Modeling and Industrial Mathematics  Strongly chordal graphs  Combinatorics  Optimization  Minimal completions  MATHEMATICS, APPLIED  COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS  TREEWIDTH  COMPLEXITY  COMPLETION  MINIMUM FILLIN  Computer science  Sandwiches  Algorithms
Chordal bipartite graphs  Sandwich monotonicity  Operations Research/Decision Theory  Convex and Discrete Geometry  Mathematics  Theory of Computation  Mathematical Modeling and Industrial Mathematics  Strongly chordal graphs  Combinatorics  Optimization  Minimal completions  MATHEMATICS, APPLIED  COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS  TREEWIDTH  COMPLEXITY  COMPLETION  MINIMUM FILLIN  Computer science  Sandwiches  Algorithms
Journal Article
SIAM journal on discrete mathematics, ISSN 08954801, 1998, Volume 11, Issue 3, pp. 437  455
.... This paper gives a unified framework for characterizations of those graphs in terms of neighborhood and clique hypergraphs which have the Helly property and whose line graph is chordal...
Chordality of line graphs  Maximum neighborhood orderings  Helly property  Duality  Tree structure  Linear time recognition  Hypertrees  Disk hypergraphs  Graphs  Neighborhood hypergraphs  Hypergraphs  Chordal graphs  Doubly chordal graphs  Clique hypergraphs  MATHEMATICS, APPLIED  tree structure  chordal graphs  neighborhood hypergraphs  chordality of line graphs  ALGORITHMS  duality  hypertrees  strongly chordal graphs  maximum neighborhood orderings  bipartite incidence graphs  graphs  CLIQUE GRAPHS  hypergraphs  MATRICES  DOMINATION  disk hypergraphs  linear time recognition  ACYCLICITY  clique hypergraphs  doubly chordal graphs  DATABASE SCHEMES
Chordality of line graphs  Maximum neighborhood orderings  Helly property  Duality  Tree structure  Linear time recognition  Hypertrees  Disk hypergraphs  Graphs  Neighborhood hypergraphs  Hypergraphs  Chordal graphs  Doubly chordal graphs  Clique hypergraphs  MATHEMATICS, APPLIED  tree structure  chordal graphs  neighborhood hypergraphs  chordality of line graphs  ALGORITHMS  duality  hypertrees  strongly chordal graphs  maximum neighborhood orderings  bipartite incidence graphs  graphs  CLIQUE GRAPHS  hypergraphs  MATRICES  DOMINATION  disk hypergraphs  linear time recognition  ACYCLICITY  clique hypergraphs  doubly chordal graphs  DATABASE SCHEMES
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 12343099, 08/2014, Volume 34, Issue 3, pp. 593  602
...) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new characterizations...
maxclique  clique  chordal graph  strongly chordal graph  closed neighborhood  Chordal graph  Clique  Closed neighborhood  Maxclique  Strongly chordal graph  MATHEMATICS
maxclique  clique  chordal graph  strongly chordal graph  closed neighborhood  Chordal graph  Clique  Closed neighborhood  Maxclique  Strongly chordal graph  MATHEMATICS
Journal Article
6.
Full Text
Mutual transferability for (F,B,R)domination on strongly chordal graphs and cactus graphs
Discrete Applied Mathematics, ISSN 0166218X, 04/2019, Volume 259, pp. 41  52
.... We prove that if G is a connected strongly chordal graph in which D1...
Domination  Stability  Transferability  Strongly chordal graphs  Cactus graphs  MATHEMATICS, APPLIED  DOMINATING SETS  Apexes  Graphs
Domination  Stability  Transferability  Strongly chordal graphs  Cactus graphs  MATHEMATICS, APPLIED  DOMINATING SETS  Apexes  Graphs
Journal Article
Graphs and Combinatorics, ISSN 09110119, 3/2014, Volume 30, Issue 2, pp. 343  352
.... It is known that, for every vertex v of a chordal graph, there exists a simplicial vertex among the vertices at maximum distance from v...
05C12  Strongly chordal graph  Power chordal graph  Eccentric vertex  Chordal graph  Mathematics  Engineering Design  Combinatorics  Dually chordal graph  Doubly chordal graph  MATHEMATICS  Graphs  Eccentrics  Combinatorial analysis
05C12  Strongly chordal graph  Power chordal graph  Eccentric vertex  Chordal graph  Mathematics  Engineering Design  Combinatorics  Dually chordal graph  Doubly chordal graph  MATHEMATICS  Graphs  Eccentrics  Combinatorial analysis
Journal Article
Journal of combinatorial theory. Series B, ISSN 00958956, 2006, Volume 96, Issue 5, pp. 673  683
A bipartite graph is
chordal bipartite if it does not contain an induced cycle of length at least six...
Characterization  Chordal bipartite graph  Strongly chordal graph  Interval bigraph  Circular arc graph  Ferrers dimension  INTERVALGRAPHS  MATHEMATICS  LIST HOMOMORPHISMS  chordal bipartite graph  interval bigraph  circular arc graph  strongly chordal graph  CIRCULARARC GRAPHS  DIGRAPHS  characterization
Characterization  Chordal bipartite graph  Strongly chordal graph  Interval bigraph  Circular arc graph  Ferrers dimension  INTERVALGRAPHS  MATHEMATICS  LIST HOMOMORPHISMS  chordal bipartite graph  interval bigraph  circular arc graph  strongly chordal graph  CIRCULARARC GRAPHS  DIGRAPHS  characterization
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 12343099, 05/2019, Volume 39, Issue 2, pp. 365  374
Several recent papers have investigated unichordfree graphs—the graphs in which no cycle has a unique chord...
05C75  unichordfree graph  strongly chordal graph  MATHEMATICS
05C75  unichordfree graph  strongly chordal graph  MATHEMATICS
Journal Article
Discrete Applied Mathematics, ISSN 0166218X, 05/2019, Volume 261, pp. 108  118
A linear programming algorithm to compute the broadcast domination number and the multipacking number of a strongly chordal graph is described...
Broadcast domination  Multipacking  Strongly chordal graph  MATHEMATICS, APPLIED  NUMBERS  Algorithms  Linear programming  Graph theory  Apexes
Broadcast domination  Multipacking  Strongly chordal graph  MATHEMATICS, APPLIED  NUMBERS  Algorithms  Linear programming  Graph theory  Apexes
Journal Article
UTILITAS MATHEMATICA, ISSN 03153681, 03/2020, Volume 114, pp. 277  281
Strongly chordal graphs are characterized here as being the chordal graphs in which the uncrossed chords of a cycle always form a forest...
crossed chords  MATHEMATICS, APPLIED  STATISTICS & PROBABILITY  chordal graph  strongly chordal graph  ptolemaic graph
crossed chords  MATHEMATICS, APPLIED  STATISTICS & PROBABILITY  chordal graph  strongly chordal graph  ptolemaic graph
Journal Article
12.
Full Text
Locally connected spanning trees in strongly chordal graphs and proper circulararc graphs
Discrete mathematics, ISSN 0012365X, 2007, Volume 307, Issue 2, pp. 208  215
...
)
. The purpose of this paper is to give lineartime algorithms for finding locally connected spanning trees on strongly chordal graphs and proper circulararc graphs...
Interval graph  Directed path graph  Strongly chordal graph  Locally connected spanning tree  Circulararc graph  Proper circulararc graph  Algorithm  circulararc graph  MATHEMATICS  locally connected spanning tree  MATRICES  FAILURES  strongly chordal graph  directed path graph  proper circulararc graph  2TREES  algorithm  interval graph  NETWORKS IMMUNE  Algorithms
Interval graph  Directed path graph  Strongly chordal graph  Locally connected spanning tree  Circulararc graph  Proper circulararc graph  Algorithm  circulararc graph  MATHEMATICS  locally connected spanning tree  MATRICES  FAILURES  strongly chordal graph  directed path graph  proper circulararc graph  2TREES  algorithm  interval graph  NETWORKS IMMUNE  Algorithms
Journal Article
Information processing letters, ISSN 00200190, 07/2012, Volume 112, Issue 13, pp. 552  556
.... In this paper, we propose constant approximation algorithms for the problem of computing λ(G) for dually chordal graphs and strongly orderable graphs...
Dually chordal graphs  Approximation algorithms  Chordal bipartite graphs  Graph algorithms  Strongly orderable graphs  [formula omitted]labeling  L (2, 1) labeling  DISTANCE2  LABELING GRAPHS  ASSIGNMENT  COMPUTER SCIENCE, INFORMATION SYSTEMS  ALGORITHMS  L(2,1)labeling  BIPARTITE GRAPHS  Computer science  Algorithms
Dually chordal graphs  Approximation algorithms  Chordal bipartite graphs  Graph algorithms  Strongly orderable graphs  [formula omitted]labeling  L (2, 1) labeling  DISTANCE2  LABELING GRAPHS  ASSIGNMENT  COMPUTER SCIENCE, INFORMATION SYSTEMS  ALGORITHMS  L(2,1)labeling  BIPARTITE GRAPHS  Computer science  Algorithms
Journal Article
Theoretical computer science, ISSN 03043975, 11/2012, Volume 459, pp. 89  99
.... This strengthens the complexity of decision version of Min DistancekPairedDom Set problem in chordal graphs...
Strongly chordal graph  APXcomplete  Distance [formula omitted]dominating set  Undirected path graph  NPcomplete  Approximation algorithm  Distance [formula omitted]paireddominating set  Distance kdominating set  Distance kpaireddominating set  INTERVAL  NUMBERS  STRONGLY CHORDAL GRAPHS  ALGORITHMS  TREES  MATRICES  COMPUTER SCIENCE, THEORY & METHODS  Algorithms
Strongly chordal graph  APXcomplete  Distance [formula omitted]dominating set  Undirected path graph  NPcomplete  Approximation algorithm  Distance [formula omitted]paireddominating set  Distance kdominating set  Distance kpaireddominating set  INTERVAL  NUMBERS  STRONGLY CHORDAL GRAPHS  ALGORITHMS  TREES  MATRICES  COMPUTER SCIENCE, THEORY & METHODS  Algorithms
Journal Article
Theoretical computer science, ISSN 03043975, 2009, Volume 410, Issue 52, pp. 5443  5454
In a graph, a vertex is simplicial if its neighborhood is a clique. For an integer
k
≥
1
, a graph
G
=
(
V
G
,
E
G
)
is the
k

simplicial power of a graph
H...
Simplicial powers  Forbidden induced subgraph  Ptolemaic graphs  Graph powers  Block graphs  Strongly chordal graphs  Leaf powers  Chordal graphs  CLIQUE GRAPHS  ROOTS  COMPUTER SCIENCE, THEORY & METHODS  LEAF
Simplicial powers  Forbidden induced subgraph  Ptolemaic graphs  Graph powers  Block graphs  Strongly chordal graphs  Leaf powers  Chordal graphs  CLIQUE GRAPHS  ROOTS  COMPUTER SCIENCE, THEORY & METHODS  LEAF
Journal Article
Journal of interconnection networks, ISSN 02192659, 10/2015, Volume 15, Issue 12
Journal Article
Discrete Applied Mathematics, ISSN 0166218X, 01/2015, Volume 181, pp. 221  234
In this paper, we present the clique arrangement A(G) for a chordal graph G to describe the intersections between the maximal cliques of G more precisely than in clique trees or related concepts...
Characterization  Clique arrangement  Chordal graph  Strongly chordal graph  Clique separator graph  Clique tree  MATHEMATICS, APPLIED  TREES  Trees  Graphs  Mathematical models  Intersections  Computation
Characterization  Clique arrangement  Chordal graph  Strongly chordal graph  Clique separator graph  Clique tree  MATHEMATICS, APPLIED  TREES  Trees  Graphs  Mathematical models  Intersections  Computation
Journal Article
Discrete Applied Mathematics, ISSN 0166218X, 07/2013, Volume 161, Issue 1011, pp. 1395  1401
... {k}dominating functions of G. In this paper, we prove that γwk(G)=γrk(G) for any strongly chordal graph G...
Domination  Strongly chordal graph  Block graph  Rainbow domination  Domatic number  [formula omitted]domination  Algorithm  [formula omitted]tuple domination  ktuple domination  (j, k) domination  (j, k)domination  MATHEMATICS, APPLIED  MATRICES  ALGORITHMS  Algorithms
Domination  Strongly chordal graph  Block graph  Rainbow domination  Domatic number  [formula omitted]domination  Algorithm  [formula omitted]tuple domination  ktuple domination  (j, k) domination  (j, k)domination  MATHEMATICS, APPLIED  MATRICES  ALGORITHMS  Algorithms
Journal Article
Theoretical computer science, ISSN 03043975, 2007, Volume 381, Issue 1, pp. 57  67
...] on graph sandwich problems published in 1995, left the status of sandwich problems for strongly chordal graphs and chordal bipartite graphs open...
Sandwich problem  Graph  Strongly chordal  Chordal  strongly chordal  chordal  sandwich problem  MATRICES  COMPUTER SCIENCE, THEORY & METHODS  ALGORITHMS  graph
Sandwich problem  Graph  Strongly chordal  Chordal  strongly chordal  chordal  sandwich problem  MATRICES  COMPUTER SCIENCE, THEORY & METHODS  ALGORITHMS  graph
Journal Article
Discussiones Mathematicae. Graph Theory, ISSN 12343099, 2012, Volume 32, Issue 4, pp. 607  615
... of i. Results include the following: A graph is strongly chordal if and only if, for i. {4, 6}, every cycle C with vertical bar V...
Ptolemaic graph  Chordal graph  Trivially perfect graph  Threshold graph  Strongly chordal graph  Chord  MATHEMATICS  threshold graph  chord  chordal graph  strongly chordal graph  trivially perfect graph  ptolemaic graph
Ptolemaic graph  Chordal graph  Trivially perfect graph  Threshold graph  Strongly chordal graph  Chord  MATHEMATICS  threshold graph  chord  chordal graph  strongly chordal graph  trivially perfect graph  ptolemaic graph
Journal Article
No results were found for your search.
Cannot display more than 1000 results, please narrow the terms of your search.