Results 41 to 50 of about 2,145,411 (284)
Degree distribution of shortest path trees and bias of network sampling algorithms [PDF]
, 2015 In this article, we explicitly derive the limiting degree distribution of the shortest path tree from a single source on various random network models with edge weights.
Bhamidi, Shankar +3 more
core +3 more sources
Stability of Complement Degree Polynomial of Graphs
مجلة بغداد للعلوم, 2023 A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of ...
Safeera K, Anil Kumar V
doaj +1 more source
Degree of h-polynomials of edge ideals
Journal of Algebraic CombinatoricsAbstract In this paper, we investigate the degree of h-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the h-polynomial for various fundamental classes of graphs such as paths, cycles, and bipartite graphs.
Jennifer Biermann +4 more
openaire +3 more sources
Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong, Yanmei, Zhang, Zhao, Liu, Qinghai
openaire +2 more sources
Edge coloring regular graphs of high degree
Discrete Mathematics, 1997 There is an old conjecture to the effect that if \(G= (V, E)\) is a \(\Delta\)-regular simple graph of even order with \(| V|\leq 2\Delta\), then \(G\) is 1-factorizable. The authors show that this conjecture is true for large graphs with \(| V| 0\). The proof is constructive and implies an algorithm for \(\Delta\)-edge-colorings of such graphs.
Perkovic, L, Reed, B
openaire +2 more sources
Ising Model on Edge-Dual of Random Networks [PDF]
, 2004 We consider Ising model on edge-dual of uncorrelated random networks with arbitrary degree distribution. These networks have a finite clustering in the thermodynamic limit.
A. Ramezanpour +4 more
core +1 more source
The Role of Individual Edges in Edge Controllability of Complex Networks
IEEE Access, 2020 Dynamical processes occurring on edges of complex networks are relevant to many real situations. Controlling the edge dynamics is a fundamental challenge in network science. Inspired by recent advances in the edge controllability theories, we explore the
Chao Li, Shaopeng Pang
doaj +1 more source
Glasnik Matematicki, 2009 Sažetak abstracta: The necessary and sufficient conditions on the existence of the trees with prescribed edge degrees are given.
openaire +3 more sources
On Partitioning the Edges of 1-Plane Graphs
, 2016 A 1-plane graph is a graph embedded in the plane such that each edge is crossed at most once. A 1-plane graph is optimal if it has maximum edge density.
Lenhart, William J. +2 more
core +1 more source
Voltage-controlled Group Velocity of Edge Magnetoplasmon in the Quantum Hall Regime [PDF]
, 2010 We investigate the group velocity of edge magnetoplasmons (EMPs) in the quantum Hall regime by means of time-of-flight measurement. The EMPs are injected from an Ohmic contact by applying a voltage pulse, and detected at a quantum point contact by ...
H. Kamata +6 more
core +1 more source