Results 21 to 30 of about 750,580 (290)
Graph complement conjecture for classes of shadow graphs [PDF]
Operators and Matrices, 2021 Summary: The real minimum semidefinite rank of a graph \(G\), denoted \(\mathrm{mr}^{\mathbb{R}}_+(G)\), is defined to be the minimum rank among all real symmetric positive semidefinite matrices whose zero/nonzero pattern corresponds to the graph \(G\).
Jansrang, Monsikarn, Narayan, Sivaram K.
openaire +2 more sources
ABC energies and spectral radii of some graph operations
Frontiers in Physics, 2022 The present article presents some new results relating to Atomic Bond Connectivity energies and Spectral radii of generalized splitting and generalized shadow graphs constructed on the basis of some fundamental families of cycle graph Cn, complete graph ...
Ahmad Bilal, Muhammad Mobeen Munir
doaj +1 more source
Albertson (Alb) spectral radii and Albertson (Alb) energies of graph operation
Frontiers in Chemistry, 2023 The sum of the absolute eigenvalues of the adjacency matrix make up graph energy. The greatest absolute eigenvalue of the adjacency matrix is represented by the spectral radius of the graph.
Muhammad Mobeen Munir, Urwah Tul Wusqa
doaj +1 more source
Shadows of Teichmüller Discs in the Curve Graph [PDF]
International Mathematics Research Notices, 2017 25 pages, 4 figures; Added Section 3.3 which includes a bounded geodesic image theorem (Theorem 1.4); Distance bound is now log(2) for both parts of Proposition 7.1; Minor revisions in Section 7 ...
Tang, Robert +1 more
openaire +3 more sources
Approximate Graph Colouring and the Hollow Shadow
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023 We show that approximate graph colouring is not solved by constantly many levels of the liftand-project hierarchy for the combined basic linear programming and affine integer programming relaxation. The proof involves a construction of tensors whose fixed-dimensional projections are equal up to reflection and satisfy a sparsity condition, which may be ...
Zivny, S, Ciardo, L
openaire +2 more sources
Complexity of Some Duplicating Networks
IEEE Access, 2021 There are plentiful ways to duplicate a graph (network), such as splitting, shadow, mirror, and total graph. In this paper, we derive an evident formula of the complexity, a number of spanning trees, of the closed helm graph, the mirror graph of the path
Mohamed R. Zeen El Deen +1 more
doaj +1 more source
On equitable near-proper coloring of some derived graph classes
Karpatsʹkì Matematičnì Publìkacìï, 2022 An equitable near-proper coloring of a graph $G$ is a defective coloring in which the number of vertices in any two color classes differ by at most one and the bad edges obtained is minimized by restricting the number of color classes that can have ...
S. Jose, S. Naduvath
doaj +1 more source
Automated Extraction of Buildings and Roads in a Graph Partitioning Framework [PDF]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2013 This paper presents an original unsupervised framework to identify regions belonging to buildings and roads from monocular very high resolution (VHR) satellite images. The proposed framework consists of three main stages.
A. O. Ok
doaj +1 more source
Guarding a Subgraph as a Tool in Pursuit-Evasion Games
Discussiones Mathematicae Graph Theory, 2022 Pursuit-evasion games study the number of cops needed to capture the robber in a game played on a graph, in which the cops and the robber move alternatively to neighbouring vertices, and the robber is captured if a cop steps on the vertex the robber is ...
Bokal Drago, Jerebic Janja
doaj +1 more source
ISI spectral radii and ISI energies of graph operations
Frontiers in Physics, 2023 Graph energy is defined to be the p-norm of adjacency matrix associated to the graph for p = 1 elaborated as the sum of the absolute eigenvalues of adjacency matrix.
Ahmad Bilal +3 more
doaj +1 more source