Results 11 to 20 of about 2,332,619 (281)
Strong Oriented Chromatic Number of Planar Graphs without Short Cycles [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Let M be an additive abelian group. An M-strong-oriented coloring of an oriented graph G is a mapping f from V(G) to M such that f(u) j(v) whenever uv is an arc in G and f(v)−f(u) −(f(t)−f(z)) whenever uv and zt are two arcs in G.
Mickael Montassier +2 more
doaj +1 more source
Lietuvos Matematikos Rinkinys, 2021 In this paper, relations between discrete Sturm--Liouville problem with nonlocal integral boundary condition characteristics (poles, critical points, spectrum curves) and graphs characteristics (vertices, edges and faces) were found. The previous article
Jonas Vitkauskas, Artūras Štikonas
doaj +1 more source
A Visualization Tool for Flood Dynamics Monitoring Using a Graph-Based Approach
Remote Sensing, 2020 Insights into flood dynamics, rather than solely flood extent, are critical for effective flood disaster management, in particular in the context of emergency relief and damage assessment.
Bos Debusscher +2 more
doaj +1 more source
A note on graph theory techniques for brain tumor detection [PDF]
Romanian Journal of Neurology, 2022 Brain Tumors are detected in people of all age groups. It leads to various complications that are both physiological and psychological. Graph theory techniques are employed to study both functional and structural behavior of brain networks.
Yegnanarayanan Venkataraman
doaj +1 more source
Quotient graphs for power graphs [PDF]
, 2017 In a previous paper of the first author a procedure was developed for counting the components of a graph through the knowledge of the components of its quotient graphs. We apply here that procedure to the proper power graph $\mathcal{P}_0(G)$ of a finite
Bubboloni, D. +2 more
core +2 more sources
New Journal of Physics, 2021 The coherent Patterson function, derived from the coherent scattering intensities from N atoms, can be described as an auto-holographic image, i.e., the superposition of N -holographic images in which each atom serves as the source of a different ...
Irene Calvo-Almazán, Paul Fenter
doaj +1 more source
An Analysis of the Use of Graphs in People’s Daily Life
Revista Colombiana de Educación, 2021 This paper addresses the issue of the lack of connection between people’s knowledge and school mathematics. It is stated that this issue generates a phenomenon of opacity in People’s Daily Life and the uses of mathematical knowledge; this means that ...
José David Zaldívar-Rojas +1 more
doaj +1 more source
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy [PDF]
, 2013 In this paper we consider kernelization for problems on d-degenerate graphs, i.e. graphs such that any subgraph contains a vertex of degree at most $d$.
D. Harnik +15 more
core +2 more sources
Information Inequalities via Submodularity and a Problem in Extremal Graph Theory
Entropy, 2022 The present paper offers, in its first part, a unified approach for the derivation of families of inequalities for set functions which satisfy sub/supermodularity properties.
Igal Sason
doaj +1 more source
Journal of Graph Algorithms and Applications, 2005 Summary: The task of drawing subgraphs is often underestimated and they are simply emphasized using different colors or line styles. In this paper, we present an approach for drawing graphs within graphs that first produces a layout for the subgraphs thus increasing their locality.
Holleis, Paul +2 more
openaire +1 more source