Results 41 to 50 of about 174,868,130 (283)

Light edges in degree-constrained graphs

open access: yesDiscrete Mathematics, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Prosenjit Bose   +2 more
openaire   +3 more sources

RAC Drawings of Graphs with Low Degree [PDF]

open access: yes, 2022
Motivated by cognitive experiments providing evidence that large crossing-angles do not impair the readability of a graph drawing, RAC (Right Angle Crossing) drawings were introduced to address the problem of producing readable representations of non ...
Pfister, Maximilian   +4 more
core   +1 more source

Evolution Model of Spatial Interaction Network in Online Social Networking Services

open access: yesEntropy, 2019
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

Computation of Vertex-Edge Degree Based Topological Descriptors for Metal Trihalides Network

open access: yesIEEE Access, 2021
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]

open access: yesSongklanakarin Journal of Science and Technology (SJST), 2022
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

On the edge degrees of trees

open access: yesGlasnik matematički, 2009
Let mij(G) be the number of edges of graph G, connecting vertices of degrees i and j. Necessary and sufficient conditions are established on a symmetric matrix M of type Δ × Δ such that there is a tree T for which Mij = mij(T) holds for all i, j.
openaire   +3 more sources

On the average degree of edge chromatic critical graphs

open access: yesJournal of Combinatorial Theory, Series B, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Cao 0001, Guantao Chen
openaire   +2 more sources

Edge-Face Coloring of Plane Graphs with Maximum Degree Nine [PDF]

open access: yes, 2010
International audienceAn edge-face coloring of a plane graph with edge set E and face set F is a coloring of the elements of E ∪ F so that adjacent or incident elements receive different colors.
Sereni, Jean-Sébastien   +3 more
core   +1 more source

Exchanging Immediate Edge App

open access: yes, 2022
Whenever you've kept cash into your Immediate Edge App record you could start trading. Prior to firing up the auto-trading, you might be mentioned to set the degree of opportunity to 'low', 'medium' or 'high', embed the most amounts of exchanges you want
Immediate Edge App
core   +1 more source

On Tosha-degree of an Edge in a Graph

open access: yesEuropean Journal of Pure and Applied Mathematics, 2020
In an earlier paper,  we have introduced the Tosha-degree of an edge in a graph without multiple edges and studied some properties. In this paper, we extend the definition of  Tosha-degree of an edge in a graph in which multiple edges are allowed. Also, we introduce the concepts - zero edges in a graph, $T$-line graph of a multigraph, Tosha-adjacency
R. Rajendra, P. Siva Kota Reddy
openaire   +2 more sources

Home - About - Disclaimer - Privacy