Results 21 to 30 of about 482,213 (239)

Closed orders and closed graphs

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
Crupi Marilena
doaj   +1 more source

On Strong Intervals in Fuzzy Graphs

Fuzzy Information and Engineering, 2017
Intervals and convexity play crucial roles in the applications of graph theory such as town planning and design of graphics. In this article, the concept of geodetic interval in graphs is extended to fuzzy graphs.
M.V. Dhanyamol, Sunil Mathew
doaj   +1 more source

Quantum ergodicity for graphs related to interval maps [PDF]

, 2006
We prove quantum ergodicity for a family of graphs that are obtained from ergodic one-dimensional maps of an interval using a procedure introduced by Pakonski et al (J. Phys. A, v. 34, 9303-9317 (2001)).
A. Bouzouina, A.I. Shnirelman, B. Helffer, F. Barra, G. Berkolaiko, G. Berkolaiko, G. Berkolaiko, G. Berkolaiko, G. Berkolaiko, G. Berkolaiko, G. Berkolaiko, G. Berkolaiko, G. Lumer, G. Tanner, G. Tanner, H. Schanz, J. Below von, J. Griffith, J. P. Keating, K. Ruedenberg, K. Życzkowski, L. Friedlander, L. Pauling, M. Degli Esposti, M. Degli Esposti, M. Harmer, M.V. Berry, P. Billingsley, P. Gérard, P. Kurlberg, P. Kurlberg, P. Pakoński, S. Gnutzmann, S. Gnutzmann, S. Nicaise, S. Zelditch, T. Kottos, T. Kottos, U. Smilansky, V. Kostrykin, Y. Colin de Verdière   +40 more
core   +2 more sources

Structural parameterizations for boxicity [PDF]

, 2014
The boxicity of a graph $G$ is the least integer $d$ such that $G$ has an intersection model of axis-aligned $d$-dimensional boxes. Boxicity, the problem of deciding whether a given graph $G$ has boxicity at most $d$, is NP-complete for every fixed $d ...
A Adiga, A Adiga, A Adiga, A Adiga, A Bielecki, B Courcelle, C Thomassen, E Asplund, FS Roberts, HL Bodlaender, J Kratochvíl, J Spinrad, L Cai, LS Chandran, M Doucha, M Yannakakis, MR Fellows, R Diestel, R Ganian, RG Downey   +19 more
core   +1 more source

Leanness Computation: Small Values and Special Graph Classes [PDF]

Discrete Mathematics & Theoretical Computer Science
Let u and v be vertices in a connected graph G = (V, E). For any integer k such that 0 ≤ k ≤ dG (u, v), the k-slice Sk (u, v) contains all vertices x on a shortest uv-path such that dG (u, x) = k.
David Coudert, Samuel Coulomb, Guillaume Ducoffe   +2 more
doaj   +1 more source

Robust Consensus in a Class of Fractional-Order Multi-Agent Systems with Interval Uncertainties Using the Existence Condition of Hermitian Matrices

Axioms, 2023
This study outlines the necessary and sufficient criteria for swarm stability asymptotically, meaning consensus in a class of fractional-order multi-agent systems (FOMAS) with interval uncertainties for both fractional orders 0 < α < 1 and 1 < α < 2. The
Mohammadreza Riazat, Aydin Azizi, Mojtaba Naderi Soorki, Abbasali Koochakzadeh   +3 more
doaj   +1 more source

A lower bound for nodal count on discrete and metric graphs

, 2006
According to a well-know theorem by Sturm, a vibrating string is divided into exactly N nodal intervals by zeros of its N-th eigenfunction. Courant showed that one half of Sturm's theorem for the strings applies to the theory of membranes: N-th ...
A.M. Duval, E.B. Davies, G. Blum, Gregory Berkolaiko, H. Herrmann, J. Friedman, J. Miller, L. Friedlander, M. Fiedler, P. Kuchment, P. Schapotschnikow, R. Band, S. Gnutzmann, S. Gnutzmann, T. Bıyıkoğlu, T. Kottos, Y. Colin de Verdière, Å. Pleijel   +17 more
core   +3 more sources

Solving the shortest path Problem in an interval-valued Neutrosophic Pythagorean environment using an enhanced A* search algorithm [PDF]

Neutrosophic Sets and Systems
The A* search algorithm is widely utilized to evaluate the shortest path in a given network. However, in a traditional A* search algorithm, the nodes are assumed to have crisp values, i.e., a single value.
Prasanta Kumar Raut, Sakya Singh Satapathy, Siva Prasad Behera, Said Broumi, Ajay Kumar Sahoo   +4 more
doaj   +1 more source

Modeling of Transport and Logistics Systems and the Study of the Structural Stability

Управленческие науки, 2020
The structural stability of the system to external influences is an important parameter of the transport and logistics task. In modern literature, the concept of structural stability is defined as applied to each individual problem, as a result of which ...
D. V. Yatskin, A. A. Kochkarov, R. A. Kochkarov   +2 more
doaj   +1 more source

Partitioning Perfect Graphs into Stars

, 2016
The partition of graphs into "nice" subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size stars, a problem known to be NP-complete even for the case of stars on three
Bredereck, Robert, Bulteau, Laurent, Chen, Jiehua, Froese, Vincent, Niedermeier, Rolf, van Bevern, René, Woeginger, Gerhard J.   +6 more
core   +3 more sources