We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:

Search Results

Showing 1-20 of 10,000 results
  1. Cohen-Macaulay weighted oriented chordal and simplicial graphs

    Herzog, Hibi, and Zheng classified the Cohen-Macaulay edge ideals of chordal graphs. In this paper, we classify Cohen-Macaulay edge ideals of...

    Kamalesh Saha in Archiv der Mathematik
    Article 10 April 2024
  2. On the oriented diameter of planar triangulations

    The diameter of an undirected or a directed graph is defined to be the maximum shortest path distance over all pairs of vertices in the graph. Given...

    Debajyoti Mondal, N. Parthiban, Indra Rajasingh in Journal of Combinatorial Optimization
    Article 20 May 2024
  3. Anisotropic Non-oriented Bond Percolation in High Dimensions

    Pablo A. Gomes, Alan Pereira, Remy Sanchis in Journal of Theoretical Probability
    Article 06 May 2023
  4. Oriented matroids from triangulations of products of simplices

    We introduce a construction of oriented matroids from a triangulation of a product of two simplices. For this, we use the structure of such a...

    Marcel Celaya, Georg Loho, Chi Ho Yuen in Selecta Mathematica
    Article Open access 28 April 2024
  5. Finitary Affine Oriented Matroids

    We initiate the axiomatic study of affine oriented matroids (AOMs) on arbitrary ground sets, obtaining fundamental notions such as minors,...

    Emanuele Delucchi, Kolja Knauer in Discrete & Computational Geometry
    Article Open access 01 May 2024
  6. Sweeps, Polytopes, Oriented Matroids, and Allowable Graphs of Permutations

    A sweep of a point configuration is any ordered partition induced by a linear functional. Posets of sweeps of planar point configurations were...

    Arnau Padrol, Eva Philippe in Combinatorica
    Article Open access 23 October 2023
  7. Faster goal-oriented shortest path search for bulk and incremental detailed routing

    We develop new algorithmic techniques for VLSI detailed routing. First, we improve the goal-oriented version of Dijkstra’s algorithm to find shortest...

    Markus Ahrens, Dorothee Henke, ... Jens Vygen in Mathematical Programming
    Article Open access 24 May 2023
  8. (2, 3)-Cordial Oriented Hypercubes

    In this article we investigate the existence of (2, 3)-cordial labelings of oriented hypercubes. In this investigation, we determine that there...
    Jonathan M. Mousley, LeRoy B. Beasley, ... David E. Brown in Combinatorics, Graph Theory and Computing
    Conference paper 2024
  9. On the Difference Between the Skew-rank of an Oriented Graph and the Rank of Its Underlying Graph

    Let G be a simple graph and G σ be the oriented graph with G as its underlying graph and orientation σ . The rank of the adjacency matrix of G is...

    Jia-min Zhu, Bo-jun Yuan, Yi Wang in Acta Mathematicae Applicatae Sinica, English Series
    Article 03 January 2024
  10. Algebraic Properties of Edge Ideals of Some Vertex-Weighted Oriented m-Partite Graphs

    In this paper we will provide the exact formulas for the regularity and projective dimension of edge ideals of three types of vertex-weighted...

    Guangjun Zhu, Hong Wang, ... Jiaqi Zhang in Bulletin of the Brazilian Mathematical Society, New Series
    Article 17 February 2021
  11. Kinetic Viscous Shock Layer near the Leading Edge of a Thin Rotating Disk

    Abstract

    A regularized problem of describing an irregular nonequilibrium flow of a homogeneous molecular gas in a hypersonic kinetic thin viscous...

    Article 24 April 2024
  12. The Oriented Diameter of Graphs with Given Connected Domination Number and Distance Domination Number

    Let G be a bridgeless graph. An orientation of G is a digraph obtained from G by assigning a direction to each edge. The oriented diameter of G is...

    Peter Dankelmann, Jane Morgan, Emily Rivett-Carnac in Graphs and Combinatorics
    Article Open access 28 January 2024
  13. Pointwise Fixation along the Edge of a Kirchhoff Plate

    We address the Sobolev–Neumann problem for the bi-harmonic equation describing the bending of the Kirchhoff plate with a traction-free edge but fixed...

    D. Gómez, S. A. Nazarov, M.-E. Pérez-Martínez in Journal of Mathematical Sciences
    Article 20 December 2023
  14. A New Width Parameter of Graphs Based on Edge Cuts: \(\alpha \) -Edge-Crossing Width

    We introduce graph width parameters, called \(\alpha \) -edge-crossing...
    Yeonsu Chang, O-joung Kwon, Myounghwan Lee in Graph-Theoretic Concepts in Computer Science
    Conference paper 2023
  15. Regularity in weighted oriented graphs

    Let D be a weighted oriented graph with the underlying graph G and I ( D ),  I ( G ) be the edge ideals corresponding to D and G respectively. We show that...

    Mousumi Mandal, Dipak Kumar Pradhan in Indian Journal of Pure and Applied Mathematics
    Article 15 June 2021
  16. Circle actions on 6-dimensional oriented manifolds with 4 fixed points

    In this paper, we classify the fixed point data (weights and signs at the fixed points), of a circle action on a 6-dimensional compact connected...

    Article 23 June 2023
  17. Data and Model Driven Task Offloading Strategy in the Dynamic Mobile Edge Computing System

    Mobile Edge Computing (MEC) provides communication and computational capabilities for the industrial Internet, meeting the demands of...

    Hairong Dong, Wei Wu, ... Zixuan Zhang in Journal of Systems Science and Complexity
    Article 27 February 2024
Did you find what you were looking for? Share feedback.