Results 91 to 100 of about 155 (146)
Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs
, 2007 A graph is dually chordal if it is the clique graph of a chordal graph. Alternatively, a graph is dually chordal if it admits a maximum neighbourhood order. This class generalizes known subclasses of chordal graphs such as doubly chordal graphs, strongly
Celina M. H. De Figueiredo +3 more
core
, 1992 . We describe a spectral nested dissection algorithm for computing orderings appropriate for parallel factorization of sparse, symmetric matrices. The algorithm makes use of spectral properties of the Laplacian matrix associated with the given matrix to ...
Lie Wang, Alex Pothen, Horst D. Simon
core
A novel algebraic technique for adjacency matrices of some derived graphs
Mathematical and Computer Modelling of Dynamical SystemsGraph energy has been the main concern of spectral graph theory in the last five decades. The classical graph energy is the sum of the absolute values of the eigenvalues of the adjacency matrix. In many research papers, different versions of graph energy
Hacer Ozden Ayna +5 more
doaj +1 more source
Completeness for the Complexity Class ∀∃R and Area-Universality. [PDF]
Discrete Comput Geom, 2023 Dobbins MG +3 more
europepmc +1 more source
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. [PDF]
Discrete Comput Geom, 2023 Casel K +4 more
europepmc +1 more source
REPRESENTATIONS OF GRAPHS ON A CYLINDER*
, 2008 . A complete characterization ofthe class ofgraphs that admit a cylindric visibility representation is presented, where vertices are representedby intervals parallel to the axis ofthe cylinderand the edgescorrespond to pairs ofvisible intervals. Moreover,
Ioannis
core
A New Parallel Chasing Algorithm For Transforming Arrowhead Matrices To Tridiagonal Form
, 1998 . Rutishauser, Gragg and Harrod and finally H.Y. Zha used the same class of chasing algorithms for transforming arrowhead matrices to tridiagonal form. Using a graphical theoretical approach, we propose a new chasing algorithm.
Suely Oliveira
core
The Convex Mixture Distribution: Granger Causality for Categorical Time Series. [PDF]
SIAM J Math Data Sci, 2021 Tank A, Li X, Fox EB, Shojaie A.
europepmc +1 more source
Connectivity of Triangulation Flip Graphs in the Plane. [PDF]
Discrete Comput Geom, 2022 Wagner U, Welzl E.
europepmc +1 more source
Direct Message Delivery Among Processors with Limited Capacity
, 2007 Processors with finite storage capacities send and receive messages among one another, with each message going directly from its sender to its recipient.
Devadatta M. Kulkarni +2 more
core