Results 1 to 10 of about 313,328 (262)
Edge-Neighbor-Rupture Degree of Graphs [PDF]
Journal of Applied Mathematics, 2013 The edge-neighbor-rupture degree of a connected graph is defined to be , where is any edge-cut-strategy of , is the number of the components of , and is the maximum order of the components of .
Ersin Aslan
doaj +4 more sources
Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph
Electronic Journal of Graph Theory and Applications, 2015 An ecard of a graph $G$ is a subgraph formed by deleting an edge. A da-ecard specifies the degree of the deleted edge along with the ecard. The degree associated edge reconstruction number of a graph $G,~dern(G),$ is the minimum number of da-ecards that ...
P. Anusha Devi, S. Monikandan
doaj +5 more sources
Facets of Random Symmetric Edge Polytopes, Degree Sequences, and Clustering [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs. For an Erd\H{o}s-
Benjamin Braun +2 more
doaj +3 more sources
Edge Degree Weight of Sequential Join of Graphs
Science Journal of University of Zakho, 2013 Let the weight w of an edge e= uv={u,v} of a graph G be defined by w(e)=deg(u)+deg(v)-2 and the weight of G be defined by w(G)= ∑ e ∈ E(G)w(e), where E(G) is the edge set of G.
Khidir R. Sharaf, Didar A. Ali
doaj +1 more source
On Edge Proper Interval-Valued Complex Fuzzy Graphs [PDF]
E3S Web of Conferences, 2023 This article summarizes about edge proper interval-valued complex fuzzy graph. Here, degree of an edge, total degree of an edge, edge proper and edge totally proper intervalvalued complex fuzzy were introduced.
Venkateshwara R., Sridevi R.
doaj +1 more source
On vertex and edge degree-based topological indices
Vojnotehnički Glasnik, 2023 Introduction/purpose: The entire topological indices (T Ient) are a class of graph invariants depending on the degrees of vertices and edges. Some general properties of these invariants are established.
Ivan Gutman
doaj +1 more source
An Improved Wavelet Modulus Algorithm Based on Fusion of Light Intensity and Degree of Polarization
Applied Sciences, 2022 Edge detection is the basis of image analysis and image processing. The wavelet modulus maxima algorithm is a widely used edge-detection algorithm. The algorithm has the advantages of strong anti-noise ability and high precision of edge location, but it ...
Yunting Gu +9 more
doaj +1 more source
A Study on Co – odd (even) Sum Degree Edge Domination Number in Graphs
مجلة بغداد للعلوم, 2023 An edge dominating set of a graph is said to be an odd (even) sum degree edge dominating set (osded (esded) - set) of G if the sum of the degree of all edges in X is an odd (even) number.
V Mohana Selvi, P Usha, D Ilakkiya
doaj +1 more source
Splices, Links, and their Edge-Degree Distances [PDF]
Transactions on Combinatorics, 2017 The edge-degree distance of a simple connected graph G is defined as the sum of the terms (d(e|G)+d(f|G))d(e,f|G) over all unordered pairs {e,f} of edges of G, where d(e|G) and d(e,f|G) denote the degree of the edge e in G and the distance between the ...
Mahdieh Azari, Hojjatollah Divanpour
doaj +1 more source
Influence of reciprocal edges on degree distribution and degree correlations [PDF]
Physical Review E, 2009 Reciprocal edges represent the lowest-order cycle possible to find in directed graphs without self-loops. Representing also a measure of feedback between vertices, it is interesting to understand how reciprocal edges influence other properties of complex networks.
Štefančić, Hrvoje, Zlatić, Vinko
openaire +2 more sources