Results 31 to 40 of about 313,328 (262)
Computation of Vertex-Edge Degree Based Topological Descriptors for Metal Trihalides Network
In recent past 2D metal trihalides have evolved as useful gapless semiconductor due to their physical properties like low dimensional magnetism and thermo electric performance.
Fouad A. Abolaban +2 more
doaj +1 more source
Some models for inverse minimum spanning tree problem with uncertain edge weights [PDF]
The inverse minimum spanning tree (IMST) problem is an inverse optimization problem in which one makes the least modification to the edge weights of a predetermined spanning tree, to make it the minimum spanning tree with respect to new edge weights ...
Sagarika Biswal, Ganesh Ghorai
doaj +1 more source
The Effect of Random Edge Removal on Network Degree Sequence [PDF]
Many networks arise in a random and distributed fashion, and yet result in having a specific type of degree structure: e.g., the WWW, many social networks, biological networks, etc., exhibit power-law, stretched exponential, or similar degree structures.
Dubois, Thomas +2 more
openaire +3 more sources
Evolution Model of Spatial Interaction Network in Online Social Networking Services
The development of online social networking services provides a rich source of data of social networks including geospatial information. More and more research has shown that geographical space is an important factor in the interactions of users in ...
Jian Dong +6 more
doaj +1 more source
Number of edges in degree-magic graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bezegová, L'udmila, Ivančo, Jaroslav
openaire +1 more source
Degree of h-polynomials of edge ideals
Abstract 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
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
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
The Role of Individual Edges in Edge Controllability of Complex Networks
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
Stability of Complement Degree Polynomial of Graphs
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

