Search
Search Results
-
-
On Asymptotically Optimal Approach for Finding of the Minimum Total Weight of Edge-Disjoint Spanning Trees with a Given Diameter
AbstractWe consider the intractable problem of finding several edge-disjoint spanning trees of the minimum total weight with a given diameter in...
-
-
Extracting Densest Sub-hypergraph with Convex Edge-Weight Functions
The densest subgraph problem (DSG) aiming at finding an induced subgraph such that the average edge-weights of the subgraph is maximized, is a...
-
-
Several Edge-Disjoint Spanning Trees with Given Diameter in a Graph with Random Discrete Edge Weights
We consider the problem of finding several edge-disjoint minimum total weight spanning trees of a given diameter in an undirected Graph with random...
-
On the Edge-Connectivity and Restricted Edge-Connectivity of Optimal 1-Planar Graphs
A graph is called 1-planar if it can be drawn on the plane (or on the sphere) such that each edge is crossed at most once. It is known that a...
-
Vertex-Coloring Graphs with 4-Edge-Weightings
An edge-weighting of a graph is called vertex-coloring if the weighted degrees yield a proper vertex coloring of the graph. It is conjectured that...
-
Edge Dismantling with Geometric Reinforcement Learning
The robustness of networks plays a crucial role in various applications. Network dismantling, the process of strategically removing nodes or edges to...
-
Acyclic Edge Coloring of 1-planar Graphs without 4-cycles
An acyclic edge coloring of a graph G is a proper edge coloring such that there are no bichromatic cycles in G . The acyclic chromatic index
... -
Injective edge-coloring of claw-free subcubic graphs
An injective edge-coloring of a graph G is an edge-coloring of G such that any two edges that are at distance 2 or in a common triangle receive...
-
Loose Edge-Connection of Graphs
In the last years, connection concepts such as rainbow connection and proper connection appeared in graph theory and obtained a lot of attention. In...
-
Algorithms for computing Pythagorean fuzzy average edge connectivity of Pythagorean fuzzy graphs
Average edge connectivity is a fundamental metric in classical and fuzzy graph theory. It is a key parameter in evaluating the reliability of a...
-
Truncation quantization in the edge calculus
Pseudodifferential operators on the half-space associated with classical symbols of order zero without transmission property are shown to belong to...
-
A New Width Parameter of Graphs Based on Edge Cuts: \(\alpha \) -Edge-Crossing Width
We introduce graph width parameters, called \(\alpha \) -edge-crossing...
-
-
Edge-Corrugation as Structural Enhancement of Shallow Shells
This contribution takes inspiration from Nervi’s work and deals with the mechanical analysis of edge-corrugated shells. Attention is paid to the...
-
A Characterization of Edge-Ordered Graphs with Almost Linear Extremal Functions
The systematic study of Turán-type extremal problems for edge-ordered graphs was initiated by Gerbner et al. (Turán problems for Edge-ordered graphs,...
-
