Results 1 to 10 of about 28,286 (155)
The Distance Laplacian Spectral Radius of Clique Trees [PDF]
Discrete Dynamics in Nature and Society, 2020 The distance Laplacian matrix of a connected graph G is defined as ℒG=TrG−DG, where DG is the distance matrix of G and TrG is the diagonal matrix of vertex transmissions of G.
Xiaoling Zhang, Jiajia Zhou
doaj +3 more sources
Clique trees of infinite locally finite chordal graphs [PDF]
The Electronic Journal of Combinatorics, 2018 We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is a bijection between the set of clique trees and the product of local finite families of finite trees.
Hofer-Temmel, Christoph, Lehner, Florian
core +5 more sources
The distance energy of clique trees [PDF]
Linear Algebra and its Applications, 2021 10 pages, 1 ...
Jin, Ya-Lei, Gu, Rui, Zhang, Xiao-Dong
openaire +2 more sources
Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs
Algorithms, 2021 This paper studies the maximum-clique independence problem and some variations of the clique transversal problem such as the {k}-clique, maximum-clique, minus clique, signed clique, and k-fold clique transversal problems from algorithmic aspects for k ...
Chuan-Min Lee
doaj +1 more source
Properties and Recognition of Atom Graphs
Algorithms, 2022 The atom graph of a connected graph is a graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all its atom trees.
Geneviève Simonet, Anne Berry
doaj +1 more source
Mathematics, 2021 Let G be a graph of order n. If the maximal connected subgraph of G has no cut vertex then it is called a block. If each block of graph G is a clique then G is called clique tree.
Shaowei Sun +2 more
doaj +1 more source
Some Chemistry Indices of Clique-Inserted Graph of a Strongly Regular Graph
Complexity, 2021 In this paper, we give the relation between the spectrum of strongly regular graph and its clique-inserted graph. The Laplacian spectrum and the signless Laplacian spectrum of clique-inserted graph of strongly regular graph are calculated.
Chun-Li Kan +3 more
doaj +1 more source
Chordal graphs through clique trees
Cadernos do IME - Série Informática, 2022 Here we present a part of the work in collaboration with Jayme Luiz Szwarcfiter and Marisa Gutierrez, during the development of the thesis of Silvia Tondato at Facultad de Ciencias Exactas (UNLP), "Grafos Cordales: árboles cliques y representaciones canónicas'', finished in 2009.
Marisa Gutierrez, Silvia Tondato
openaire +1 more source
Computing the Atom Graph of a Graph and the Union Join Graph of a Hypergraph
Algorithms, 2021 The atom graph of a graph is a graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all possible atom trees of this graph.
Anne Berry, Geneviève Simonet
doaj +1 more source
Total Roman {2}-Dominating Functions in Graphs
Discussiones Mathematicae Graph Theory, 2022 A Roman {2}-dominating function (R2F) is a function f : V → {0, 1, 2} with the property that for every vertex v ∈ V with f(v) = 0 there is a neighbor u of v with f(u) = 2, or there are two neighbors x, y of v with f(x) = f(y) = 1.
Ahangar H. Abdollahzadeh +3 more
doaj +1 more source