Log in

Relevant bibliographies by topics / Edge / Journal articles

To see the other types of publications on this topic, follow the link: Edge.

Journal articles on the topic 'Edge'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Edge.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Young, Hilary C., Tyler G. Reid, Lea A. Randall, et al. "Influences of Movement Behavior on Animal Distributions at Edges of Homogeneous Patches." International Journal of Zoology 2013 (2013): 1–8. http://dx.doi.org/10.1155/2013/602845.

Full text

Abstract:

We propose that changes in movement behavior may be a proximate mechanism that influences the accumulation of animals at habitat edges. We tested this idea with a combination of empirical and simulation experiments in a resource-free landscape. The movements of individual flour beetles,Tribolium confusum, were tracked across a paper arena edged with invisible tape until beetles crossed the edge. Movement behavior (step lengths and turn angles) and cumulative occupancy were analyzed according to distance from the edge. We found that beetles took smaller steps with larger turn angles near edges

APA, Harvard, Vancouver, ISO, and other styles

2

Bošković, Željko. "Getting Really Edgy: On the Edge of the Edge." Linguistic Inquiry 47, no. 1 (2016): 1–33. http://dx.doi.org/10.1162/ling_a_00203.

Full text

Abstract:

The article argues that in constructions where there is more than one phrase at a phasal edge, only the highest edge is available for movement and anaphor binding. This shows that only the outermost edge counts as the edge of a phase for the Phase Impenetrability Condition ( PIC). The article also demonstrates that moving the element that counts as the phasal edge in multiple specifier/adjunct cases can affect the PIC status of the remaining edges. These conclusions provide a new argument for the contextuality of phasehood. A number of recent works have argued that the phasal status of a phras

APA, Harvard, Vancouver, ISO, and other styles

3

Konishi, Akihito, Yasukazu Hirao, Hiroyuki Kurata, Takashi Kubo, Masayoshi Nakano, and Kenji Kamada. "Anthenes: Model systems for understanding the edge state of graphene nanoribbons." Pure and Applied Chemistry 86, no. 4 (2014): 497–505. http://dx.doi.org/10.1515/pac-2013-0811.

Full text

Abstract:

AbstractThe edge state, which is a peculiar magnetic state in zigzag-edged graphene nanoribbons (ZGNRs) originating from an electron–electron correlation in an edge-localized π-state, has promising applications for magnetic and spintronics devices and has attracted much attention of physicists, chemists, and engineers. For deeper understanding of the edge state, precise fabrication of edge structures in ZGNRs has been highly demanded. We focus on anthenes, which are peri-condensed anthracenes that have zigzag and armchair edges on the molecular periphery, as model systems for understanding, an

APA, Harvard, Vancouver, ISO, and other styles

4

강은경. "Symmetries of edges in phonology: EDGE-HIGHLIGHT and EDGE-AVOIDANCE." Studies in Phonetics, Phonology, and Morphology 14, no. 3 (2008): 329–53. http://dx.doi.org/10.17959/sppm.2008.14.3.329.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Wong, Yuki, Nurul Ezaila Alias, Tian Swee Tan, and Michael Loong Peng Tan. "Investigating Transmission Coefficients of AB-Stacked Bilayer Graphene Nanoribbons with Varied Edge Configurations." ELEKTRIKA- Journal of Electrical Engineering 23, no. 2 (2024): 92–98. http://dx.doi.org/10.11113/elektrika.v23n2.575.

Full text

Abstract:

In this study, the transmission coefficients of AB-stacked bilayer graphene nanoribbons (AB-BGNRs) with different edge configurations, specifically zigzag and armchair edges, are comprehensively investigated. These coefficients are modeled and simulated using the tight-binding (TB) model and non-equilibrium Green’s function (NEGF) formalism. The impact of edge structures on the electronic properties of AB-BGNRs is highlighted, providing insights into their potential applications in nanoelectronics devices. Significant variations between zigzag and armchair-edged bilayer graphene nanoribbons (B

APA, Harvard, Vancouver, ISO, and other styles

6

Breś, Justyna, and Karolina A. Krośnicka. "Evolution of Edges and Porosity of Urban Blue Spaces: A Case Study of Gdańsk." Urban Planning 6, no. 3 (2021): 90–104. http://dx.doi.org/10.17645/up.v6i3.4108.

Full text

Abstract:

Current waterfront studies focus mainly on a land-based perspective, failing to include the water side. Water is, however, not just a resource for port and industrial purposes and an edge to the waterfront; it is also a feature of the waterfront and the complex relation between water and city. Thus, the article suggests that water-land edges need to be re-contextualised, taking into consideration also their shape, functionality, and evolution over time. This article therefore introduces the concept of urban blue spaces, that is, spaces that include at least one land-water edge, such as a shore

APA, Harvard, Vancouver, ISO, and other styles

7

Mapurisa, W., and G. Sithole. "IMPROVED EDGE DETECTION FOR SATELLITE IMAGES." ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences V-2-2022 (May 17, 2022): 185–92. http://dx.doi.org/10.5194/isprs-annals-v-2-2022-185-2022.

Full text

Abstract:

Abstract. Edges are a key feature employed in various computer vision applications namely segmentation, object recognition, feature tracking and 3D reconstruction. Edges provide key information with regards to object presence, shape, form and detail which aid in many computer vision tasks. While there are various edge detection techniques in literature, challenges in edge detection remain. Varying image contrast due to non uniform scene illumination and imaging resolution affects the edge information obtained from any given image. The edge detection results are characterised by missing edges,

APA, Harvard, Vancouver, ISO, and other styles

8

Nalwa, Vishvjit S., and Eric Pauchon. "Edgel aggregation and edge description." Computer Vision, Graphics, and Image Processing 38, no. 2 (1987): 228. http://dx.doi.org/10.1016/s0734-189x(87)80142-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Nalwa, Vishvjit S., and Eric Pauchon. "Edgel aggregation and edge description." Computer Vision, Graphics, and Image Processing 40, no. 1 (1987): 79–94. http://dx.doi.org/10.1016/0734-189x(87)90057-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Janani R. "On Edge Prime Index of a Graph." Communications on Applied Nonlinear Analysis 31, no. 2 (2024): 42–54. http://dx.doi.org/10.52783/cana.v31.512.

Full text

Abstract:

Relatively Prime Edge labeling extends the notion of prime labeling by considering edges. Prime labeling requires adjacent vertices to possess relatively prime labels, while relatively prime edge labeling requires adjacent edges to have relatively prime labels. The transformation of a coprime edge-labeled graph into a relatively prime edge-labeled graph introduces the concept of Edge Prime Index (or Relatively Prime Index). This study focuses on cases where a coprime edge-labeled graph can be converted into a relatively prime edge-labeled graph by removing certain edges from graph G, thereby e

APA, Harvard, Vancouver, ISO, and other styles

11

Werner, Liliana, and Manfred Tetz. "Edge Profiles of Currently Available Intraocular Lenses and Recent Improvements." European Ophthalmic Review 03, no. 02 (2009): 74. http://dx.doi.org/10.17925/eor.2009.03.02.74.

Full text

Abstract:

We evaluated the microstructure of the edges of currently available foldable intraocular lenses (IOLs). The methodology used assisted an IOL manufacturer (Hoya, Japan) to optimise the edge profile of its lenses. Ten designs of hydrophobic acrylic, six designs of silicone and 24 designs of hydrophilic acrylic IOLs were imaged under scanning electron microscopy (SEM), and the photographs were imported to a digital computer program. The area above the posterior–lateral edge, representing the deviation from a perfect square, was measured in square microns. There was a large variation of the area v

APA, Harvard, Vancouver, ISO, and other styles

12

M.Rekha. "Power Edge Domination Number of Certain Graphs in its Corona Product." Panamerican Mathematical Journal 35, no. 3s (2025): 88–93. https://doi.org/10.52783/pmj.v35.i3s.3536.

Full text

Abstract:

For a graph G(V,E) with size n any edge f∈E, a set S^'⊆E is said to be power edge dominating set of graphs G if each edge e∈E-S^' is dominated in S^' by the following rules if : (i) an edge f in G is in power edge dominating set (in short PEDS), then it dominates itself and dominates all the adjacent edges of f, (ii) an observed edge g in G has m >1 adjacent edges and if m-1 of these edges are observed earlier, then the remaining non-observed edge is also observed by g∈G. The minimum cardinality of a power edge domination number of G denoted by γ_ped^' (G). In this paper we introduce a new

APA, Harvard, Vancouver, ISO, and other styles

13

Magura, Tibor, and Bela Tóthmérész. "Trophic level and edge history modulate the depth of edge influence." ARPHA Conference Abstracts 2 (June 12, 2019): e37132. https://doi.org/10.3897/aca.2.e37132.

Full text

Abstract:

Habitat edges are increasingly important worldwide because of forest fragmentation and the loss of natural habitats. Reduction in habitat area, increased isolation of fragments are considered to be the primary cause of species decline and extinction in fragmented landscapes. Edge effect is a key determinant, since most effects of fragmentation attributed to patch area may be scaled-up edge effect. Moreover, the isolation of patches is basically determined by the filter function (permeability) of edges. The distance that edge effects extend into the adjacent core (interior) habitat (the depth o

APA, Harvard, Vancouver, ISO, and other styles

14

Norris, D. Ryan, Bridget J. M. Stutchbury, and Trevor E. Pitcher. "The Spatial Response of Male Hooded Warblers to Edges in Isolated Fragments." Condor 102, no. 3 (2000): 595–600. http://dx.doi.org/10.1093/condor/102.3.595.

Full text

Abstract:

Abstract We tested whether Hooded Warblers (Wilsonia citrina) avoided abrupt forest edges by radiotracking males breeding in small, isolated forest patches (0.5–2.0 ha) in northwest Pennsylvania. Because territory edges were synonymous with abrupt forest edges in all cases, we compared space use patterns with males radiotracked in a nearby continuous forest (150 ha), where we defined edge from territorial boundaries. Based on the proportion of edge to core area, males in both habitats avoided the area within 20 m of the edge, implying that males responded to the presence of territory edge rath

APA, Harvard, Vancouver, ISO, and other styles

15

Raj, P. Markondeya, Stanley M. Dunn, and W. Roger Cannon. "Edge Sharpening for Unbiased Edge Detection in Field Emission Scanning Electron Microscope Images." Microscopy and Microanalysis 5, no. 2 (1999): 136–46. http://dx.doi.org/10.1017/s1431927699000100.

Full text

Abstract:

We report here a specific type of edge strength anisotropy observed in field emission scanning electron microscope (FESEM) images. The images show weaker edge gradients in the scanning direction and hence these edges frequently go undetected. Direct application of edge detection algorithms to images with nondistinct edges, such as powder particles, show strong bias to edges perpendicular to the scanning direction. Edge orientation polarograms obtained from these images always show strong fictitious particle orientation in the scanning direction. In this work, we discuss an edge-sharpening algo

APA, Harvard, Vancouver, ISO, and other styles

16

He, Dong Jian, Rui Shu Liu, and Huai Bo Song. "Closed Salient Edge Extraction Based on Visual Attention Mechanism." Applied Mechanics and Materials 58-60 (June 2011): 1972–78. http://dx.doi.org/10.4028/www.scientific.net/amm.58-60.1972.

Full text

Abstract:

Edge detection is a means of generating compact descriptions which preserve most of the structural information in an image. However, the edge image returned by the edge operators usually contains false edge points or exhibits gaps in edges which are generated by image noise. To solve the problem, a closed salient edge extraction approach was proposed, which makes use of the visual attention model given out by Itti together with the original edge image to obtain the salient edges and then the salient-edge gaps were linked so that the closed salient edge of an image can be extracted. In order to

APA, Harvard, Vancouver, ISO, and other styles

17

KRANAKIS, EVANGELOS, DANNY KRIZANC, OSCAR MORALES PONCE, and LADISLAV STACHO. "BOUNDED LENGTH, 2-EDGE AUGMENTATION OF GEOMETRIC PLANAR GRAPHS." Discrete Mathematics, Algorithms and Applications 04, no. 03 (2012): 1250036. http://dx.doi.org/10.1142/s179383091250036x.

Full text

Abstract:

2-Edge connectivity is an important fault tolerance property of a network because it maintains network communication despite the deletion of a single arbitrary edge. Planar spanning subgraphs have been shown to play a significant role for achieving local decentralized routing in wireless networks. Existing algorithmic constructions of spanning planar subgraphs of unit disk graphs (UDGs) such as Minimum Spanning Tree, Gabriel Graph, Nearest Neighborhood Graph, etc. do not always ensure connectivity of the resulting graph under single edge deletion. Furthermore, adding edges to the network so as

APA, Harvard, Vancouver, ISO, and other styles

18

Dobrescu, Oana-Ancuta, and M. Apostol. "Tight-binding approximation for bulk and edge electronic states in graphene." Canadian Journal of Physics 93, no. 5 (2015): 580–84. http://dx.doi.org/10.1139/cjp-2014-0313.

Full text

Abstract:

The tight-binding approximation is employed here to investigate electronic bulk and edge (“surface”) states in semi-infinite graphene sheets and graphene monolayer ribbons with various edge terminations (zigzag, horseshoe, and armchair edges). It is shown that edge states do not exist for a uniform hopping (transfer) matrix. The problem is generalized to include edge elements of the hopping matrix distinct from the infinite-sheet (“bulk”) ones. In this case, semi-infinite graphene sheets with zigzag or horseshoe edges exhibit edge states, while semi-infinite graphene sheets with armchair edges

APA, Harvard, Vancouver, ISO, and other styles

19

Mkrtchyan, Vahan. "The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability." Journal of Graph Algorithms and Applications 28, no. 1 (2024): 129–47. http://dx.doi.org/10.7155/jgaa.v28i1.2931.

Full text

Abstract:

A $k$-edge-coloring of a graph is an assignment of colors $\{1,...,k\}$ to edges of the graph such that adjacent edges receive different colors. In the maximum $k$-edge-colorable subgraph problem we are given a graph and an integer $k$, the goal is to find a $k$-edge-colorable subgraph with maximum number of edges together with its $k$-edge-coloring. In this paper, we consider the maximum 2-edge-colorable subgraph problem and present some results that deal with the fixed-parameter tractability of this problem.

APA, Harvard, Vancouver, ISO, and other styles

20

Bollinger, Eric K., and Thomas A. Gavin. "Responses of Nesting Bobolinks (Dolichonyx Oryzivorus) to Habitat Edges." Auk 121, no. 3 (2004): 767–76. http://dx.doi.org/10.1093/auk/121.3.767.

Full text

Abstract:

Abstract Avoidance of habitat edges may be contributing to reduced densities of grass-land birds in small habitat patches. Nest densities for grassland-nesting Bobolinks (Dolichonyx oryzivorus) were much lower than expected within 25 m of forest edges at three sites in New York, and that pattern (“edge avoidance”) extended to 100 m at one site. Nests located within 50 m of forest or wooded hedgerow edges had lower daily survival rates, compared with nests ≥100 m from any habitat edge. Bobolinks tended to move away from forest edges when renesting after nest failure; that pattern was especially

APA, Harvard, Vancouver, ISO, and other styles

21

Toyonaga, Kenji. "The location of classified edges due to the change in the geometric multiplicity of an eigenvalue in a tree." Special Matrices 7, no. 1 (2019): 257–62. http://dx.doi.org/10.1515/spma-2019-0019.

Full text

Abstract:

Abstract Given a combinatorially symmetric matrix A whose graph is a tree T and its eigenvalues, edges in T can be classified in four categories, based upon the change in geometric multiplicity of a particular eigenvalue, when the edge is removed. We investigate a necessary and sufficient condition for each classification of edges. We have similar results as the case for real symmetric matrices whose graph is a tree. We show that a g-2-Parter edge, a g-Parter edge and a g-downer edge are located separately from each other in a tree, and there is a g-neutral edge between them. Furthermore, we s

APA, Harvard, Vancouver, ISO, and other styles

22

Wang, Yanling, and Shiying Wang. "Edge-fault-tolerant strong Menger edge connectivity of bubble-sort graphs." AIMS Mathematics 6, no. 12 (2021): 13210–21. http://dx.doi.org/10.3934/math.2021763.

Full text

Abstract:

<abstract><p>This paper studies the edge-fault-tolerant strong Menger edge connectivity of $ n $-dimensional bubble-sort graph $ B_{n} $. We give the values of faulty edges that $ B_{n} $ can tolerant when $ B_{n} $ is strongly Menger edge connected under two conditions. When there are $ (n-3) $ faulty edges removed from $ B_{n} $, the $ B_{n} $ network is still working and it is strongly Menger edge connected. When the condition of any vertex in $ B_{n} $ has at least two neighbors is imposed, the number of faulty edges that can removed from $ B_{n} $ is $ (2n-6) $ when $ B_{n} $

APA, Harvard, Vancouver, ISO, and other styles

23

Meng, Belinda Chong Chiew, Dayang Suhaida Awang Damit, and Nor Salwa Damanhuri. "Comparative studies of multiscale edge detection using different edge detectors for MRI thigh." Bulletin of Electrical Engineering and Informatics 10, no. 4 (2021): 1979–86. http://dx.doi.org/10.11591/eei.v10i4.2220.

Full text

Abstract:

Edge detection plays an important role in computer vision to extract object boundary. Multiscale edge detection method provides a variety of image features by different resolution at multiscale of edges. The method extracts coarse and fine structure edges simultaneously in an image. Due to this, the multiscale method enables more reliable edges are detected. Most of the multiscale methods are not translation invariant due to the decimated process. They mostly depend on the corresponding transform coefficients. These methods need more computation and a larger storage space. This study proposes

APA, Harvard, Vancouver, ISO, and other styles

24

Belinda, Chong Chiew Meng, Suhaida Awang Damit Dayang, and Salwa Damanhuri Nor. "Comparative studies of multiscale edge detection using different edge detectors for MRI thigh." Bulletin of Electrical Engineering and Informatics 10, no. 4 (2021): 1979~1986. https://doi.org/10.11591/eei.v10i4.2220.

Full text

Abstract:

Edge detection plays an important role in computer vision to extract object boundary. Multiscale edge detection method provides a variety of image features by different resolution at multiscale of edges. The method extracts coarse and fine structure edges simultaneously in an image. Due to this, the multiscale method enables more reliable edges are detected. Most of the multiscale methods are not translation invariant due to the decimated process. They mostly depend on the corresponding transform coefficients. These methods need more computation and a larger storage space. This study proposes

APA, Harvard, Vancouver, ISO, and other styles

25

K.S, Kanzul Fathima, and Jahir Hussain R. "An Introduction to Fuzzy Edge Coloring." JOURNAL OF ADVANCES IN MATHEMATICS 11, no. 10 (2016): 5742–48. http://dx.doi.org/10.24297/jam.v11i10.801.

Full text

Abstract:

In this paper, a new concept of fuzzy edge coloring is introduced. The fuzzy edge coloring is an assignment of colors to edges of a fuzzy graph G. It is proper if no two strong adjacent edges of G will receive the same color. Fuzzy edge chromatic number of G is least positive integer for which G has a proper fuzzy edge coloring. In this paper, the fuzzy edge chromatic number of different classes of fuzzy graphs and the fuzzy edge chromatic number of fuzzy line graphs are found. Isochromatic fuzzy graph is also defined.

APA, Harvard, Vancouver, ISO, and other styles

26

Bharathi, T., S. Shiny Paulin, and S. Leo. "Cryptographic approach on edge regular power fuzzy graph." Journal of Discrete Mathematical Sciences and Cryptography 28, no. 3 (2025): 945–58. https://doi.org/10.47974/jdmsc-2216.

Full text

Abstract:

In this paper, we newly define the notion of edge regular power fuzzy graph, based on the properties of edge regular fuzzy graph and power fuzzy graph (PFG). Totally edge regular power fuzzy graph is presented as a special case of edge regular power fuzzy graph. General formulas are derived to calculate the degree of edges for a total power fuzzy graph when it is edge regular and total degree of edges when it is totally edge regular. Further, this concept is applied in the encryption method to decipher data by authorised persons.

APA, Harvard, Vancouver, ISO, and other styles

27

Zhang, Heng Lei, Dhananjay Ravat, Yára R. Marangoni, and Xiang Yun Hu. "NAV-Edge: Edge detection of potential-field sources using normalized anisotropy variance." GEOPHYSICS 79, no. 3 (2014): J43—J53. http://dx.doi.org/10.1190/geo2013-0218.1.

Full text

Abstract:

Most existing edge-detection algorithms are based on the derivatives of potential-field data, and thus, enhance high wavenumber information and are sensitive to noise. The normalized anisotropy variance method (NAV-Edge) was proposed for detecting edges of potential-field anomaly sources based on the idea of normalized standard deviation (NSTD). The main improvement over the balanced, windowed normalized variance method (i.e., NSTD) used for similar purposes was the application of an anisotropic Gaussian function designed to detect directional edges and reduce sensitivity to noise. NAV-Edge di

APA, Harvard, Vancouver, ISO, and other styles

28

Suzuki, Masahiro, and Kazuhisa Yanaka. "Different latencies of edge detection cause the fluttering-heart illusion." Optical Review 28, no. 2 (2021): 159–73. http://dx.doi.org/10.1007/s10043-021-00646-8.

Full text

Abstract:

AbstractWe studied the mechanism causing the fluttering-heart illusion in which the motion of an inner figure appears unsynchronized compared with that of the outer figure surrounding it although the motion of both figures is objectively synchronized in reality. Experiment 1 examined the effect of edges’ luminance contrasts. The illusion was measured under conditions where the luminance contrasts of the outer and inner figures’ edges were varied. The results indicated that the illusion occurred when the outer figure’s edge had a high luminance contrast and the inner figure’s edge had a low lum

APA, Harvard, Vancouver, ISO, and other styles

29

Ji, Yu Rong, Ai Jun Li, and Jing Jing Yao. "On Edge-Balance Index Sets of the Graph C_nxP₆(n=3,4,5mod6)." Advanced Materials Research 339 (September 2011): 662–65. http://dx.doi.org/10.4028/www.scientific.net/amr.339.662.

Full text

Abstract:

Let G be a simple graph with vertex set V(G) and edge set E(G), and let Z2 = {0,1}. For a given binary edge labeling f :E(G)→Z2 , the edge labeling f induces a partial vertex labeling f*:V(G)→Z2 such that f*(v) =1(0) iff the number of 1-edges (0-edges) is strictly greater than the number of 0-edges (1-edges) incident to v , otherwise f*(v) is idefined. For i∈Z2 , let v(i)=card{v∈V(G): f*(v) =i} and e(i) = card{e∈E(G) : f (e)=i}. The edge-balance index sets of a graph G,EBI(G), is defined as {|v(0) −v(1) |: the edge labeling f satisfies |e(0)−e(1) |≤1}.In this paper, we completely determine the

APA, Harvard, Vancouver, ISO, and other styles

30

Kucharczuk, Natalia, Tomasz Wąs, and Oskar Skibski. "PageRank for Edges: Axiomatic Characterization." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 5 (2022): 5108–15. http://dx.doi.org/10.1609/aaai.v36i5.20444.

Full text

Abstract:

Edge centrality measures are functions that evaluate the importance of edges in a network. They can be used to assess the role of a backlink for the popularity of a website as well as the importance of a flight in virus spreading. Various node centralities have been translated to apply for edges, including Edge Betweenness, Eigenedge (edge version of eigenvector centrality), and Edge PageRank. With this paper, we initiate the discussion on the axiomatic properties of edge centrality measures. We do it by proposing an axiomatic characterization of Edge PageRank. Our characterization is the firs

APA, Harvard, Vancouver, ISO, and other styles

31

Kamaraj, T., and J. Thangakani. "Edge even and edge odd graceful labelings of Paley Graphs." Journal of Physics: Conference Series 1770, no. 1 (2021): 012068. http://dx.doi.org/10.1088/1742-6596/1770/1/012068.

Full text

Abstract:

Abstract Edge even graceful labeling is a novel graceful labelling, introduced in 2017 by Elsonbaty and Daoud. A graph G with p vertices and q edges is called an edge even graceful if there is a bijection f: E(G) → {2, 4,. . ., 2q} such that, when each vertex is assigned the sum of the labels of all edges incident to it mod 2k, where k = max (p, q), the resulting vertex labels are distinct. A labeling of G is called edge odd graceful labeling, if there exists a bijection f from the set of edges E(G) to the set {1,3,5,…,2q-1} such that the induced the map f* from the set of vertices V(G) to {0,

APA, Harvard, Vancouver, ISO, and other styles

32

Xiao, Chuan Min, Tian Lei Ma, and Ren Bo Xia. "An Edge Detection Algorithm Based on Human Visual System." Advanced Materials Research 760-762 (September 2013): 1519–23. http://dx.doi.org/10.4028/www.scientific.net/amr.760-762.1519.

Full text

Abstract:

Edge detection is a fundamental problem in computer vision. In this paper, we present an effective algorithm to find salient edges from infrared scene images based on Human Visual System. The algorithm integrates three basic edge features: edge contrast, edge density and edge length. In this manner, the proposed algorithm works well to detect salient region boundaries and to suppress false edges from background and texture. The experimental results demonstrate the effectiveness of the proposed algorithm.

APA, Harvard, Vancouver, ISO, and other styles

33

Petrou, M., and J. Kittler. "Optimal edge detectors for ramp edges." IEEE Transactions on Pattern Analysis and Machine Intelligence 13, no. 5 (1991): 483–91. http://dx.doi.org/10.1109/34.134047.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Zhang, Liu, Liu, Li, and Ye. "Edge Detection Algorithm of a Symmetric Difference Kernel SAR Image Based on the GAN Network Model." Symmetry 11, no. 4 (2019): 557. http://dx.doi.org/10.3390/sym11040557.

Full text

Abstract:

The symmetrical difference kernel SAR image edge detection algorithm based on the Canny operator can usually achieve effective edge detection of a single view image. When detecting a multi-view SAR image edge, it has the disadvantage of a low detection accuracy. An edge detection algorithm for a symmetric difference nuclear SAR image based on the GAN network model is proposed. Multi-view data of a symmetric difference nuclear SAR image are generated by the GAN network model. According to the results of multi-view data generation, an edge detection model for an arbitrary direction symmetric dif

APA, Harvard, Vancouver, ISO, and other styles

35

Khalaf, Shadi Ibrahim, and Sultan Senan Mahde. "Edge hub number in graphs." Online Journal of Analytic Combinatorics, no. 14 (December 31, 2019): 1–18. https://doi.org/10.61091/ojac-1407.

Full text

Abstract:

Let \( G \) be a graph, a subset \( S \subseteq E(G) \) is called an edge hub set of \( G \) if every pair of edges \( e, f \in E(G) \setminus S \) are connected by a path where all internal edges are from \( S \). The minimum cardinality of an edge hub set is called the edge hub number of \( G \), and is denoted by \( h_e(G) \). If \( G \) is a disconnected graph, then any edge hub set must contain all of the edges in all but one of the components, as well as an edge hub set in the remaining component. In this paper, the edge hub number for several classes of graphs is computed, and bounds in

APA, Harvard, Vancouver, ISO, and other styles

36

Zhang, Li, Lie Jun Wang, Sen Hai Zhong, and Gang Zhao. "Contents Based Color Image Edge Detection Using Hessian Matrix." Applied Mechanics and Materials 427-429 (September 2013): 1853–60. http://dx.doi.org/10.4028/www.scientific.net/amm.427-429.1853.

Full text

Abstract:

The edges are the most fundamental and important characteristic of an image, edge detection is the key link and classic topic in machine vision and image processing. Considering the human visual characteristics, the intrinsic gradient direction information of color images was used to obtain the pseudo-color edges of the images by conducting multichannel edge detection. After enhancing the edge information and removing the correlation, the brightness is extracted in order to obtain complete image edge information. To make the edges more smooth and continuous, the Hessian matrix is used to remov

APA, Harvard, Vancouver, ISO, and other styles

37

Meddah, Nacéra, and Mustapha Chellali. "Edges contained in all or in no minimum edge dominating set of a tree." Discrete Mathematics, Algorithms and Applications 11, no. 04 (2019): 1950040. http://dx.doi.org/10.1142/s179383091950040x.

Full text

Abstract:

In a graph, an edge dominates itself and all its adjacent edges. An edge dominating set (EDS) in a graph [Formula: see text] is a subset of edges that dominates every edge of [Formula: see text] In this paper, we characterize edges that are in all or in no minimum EDS in trees.

APA, Harvard, Vancouver, ISO, and other styles

38

S, Britto Ramesh Kumar, and Bhuvaneshwari A. "AN EFFICIENT BRITWARI TECHNIQUE TO ENHANCE CANNY EDGE DETECTION ALGORITHM USING DEEP LEARNING." ICTACT Journal on Soft Computing 12, no. 3 (2022): 2634–39. http://dx.doi.org/10.21917/ijsc.2022.0377.

Full text

Abstract:

Artificial Intelligence edge detection refers to a set of mathematical techniques used to recognize digital image locations. The picture brightness plays a vital role in detecting dissimilarities and making decisions. Edges are the sharp changes in pictures with respect to the brightness and are commonly categorized into a collection of curved line segments. The main focus of this paper is to find sharp corner edges and the false edges present in the MRI images. The canny edge algorithm is a popular method for detecting these types of edges. The traditional canny edge detection technique has v

APA, Harvard, Vancouver, ISO, and other styles

39

Kaiser, Sara A., and Catherine A. Lindell. "Effects of Distance to Edge and Edge Type on Nestling Growth and Nest Survival in the Wood Thrush." Condor 109, no. 2 (2007): 288–303. http://dx.doi.org/10.1093/condor/109.2.288.

Full text

Abstract:

Abstract Many studies investigating edge effects on forest-nesting birds have focused on nest success. Fewer have examined edge effects on other components of fitness. Nestling growth rates have been positively correlated with food availability, which may differ at edges compared to the forest interior. However, previous work has not examined growth as a function of distance to edge and edge type. We investigated whether edge type, distance to edge, hatching date, brood size, brood parasitism, year, and site influenced growth rates of wings, tarsi, and mass of nestling Wood Thrushes (Hylocichl

APA, Harvard, Vancouver, ISO, and other styles

40

Rajendra, R., and P. Siva Kota Reddy. "On Tosha-degree of an Edge in a Graph." European Journal of Pure and Applied Mathematics 13, no. 5 (2020): 1097–109. http://dx.doi.org/10.29020/nybg.ejpam.v13i5.3710.

Full text

Abstract:

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 matrix, Tosha-energy, edge-adjacency matrix and edge energy of a graph $G$ and obtain some results.

APA, Harvard, Vancouver, ISO, and other styles

41

Smirnov, Alexander Valeryevich. "The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph." Modeling and Analysis of Information Systems 30, no. 1 (2023): 6–15. http://dx.doi.org/10.18255/1818-1015-2023-1-6-15.

Full text

Abstract:

In this paper, we study undirected multiple graphs of any natural multiplicity $k>1$. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of $k$ linked edges, which connect 2 or $(k+1)$ vertices, correspondingly. The linked edges should be used simultaneously. If a vertex is incident to a multiple edge, it can be also incident to other multiple edges and it can be the common end of $k$ linked edges of some multi-edge. If a vertex is the common end of some multi-edge, it cannot be the common end of another multi-edge. As

APA, Harvard, Vancouver, ISO, and other styles

42

A. S., Saranya, and Santhosh Kumar K. R. "On the total edge irregularity strength of certain classes of cycle related graphs." Proyecciones (Antofagasta) 43, no. 1 (2024): 53–67. http://dx.doi.org/10.22199/issn.0717-6279-5728.

Full text

Abstract:

For a graph G=(V,E), an edge irregular total k-labeling is a labeling of the vertices and edges of G with labels from the set {1, 2, ..., k } such that any two different edges have distinct weights. The sum of the label of edge uv and the labels of vertices u and v determines the weight of the edge uv. The smallest possible k for which the graph G has an edge irregular total k-labeling is called the total edge irregularity strength of G. We determine the exact value of the total edge irregularity strength for some cycle related graphs.

APA, Harvard, Vancouver, ISO, and other styles

43

Khan, Sajid, Dong-Ho Lee, Muhammad Asif Khan, et al. "Image Interpolation via Gradient Correlation-Based Edge Direction Estimation." Scientific Programming 2020 (April 21, 2020): 1–12. http://dx.doi.org/10.1155/2020/5763837.

Full text

Abstract:

This paper introduces an image interpolation method that provides performance superior to that of the state-of-the-art algorithms. The simple linear method, if used for interpolation, provides interpolation at the cost of blurring, jagging, and other artifacts; however, applying complex methods provides better interpolation results, but sometimes they fail to preserve some specific edge patterns or results in oversmoothing of the edges due to postprocessing of the initial interpolation process. The proposed method uses a new gradient-based approach that makes an intelligent decision based on t

APA, Harvard, Vancouver, ISO, and other styles

44

Shirkande, Aparna S., Sakshi S. Sawant, Neha V. Shinde, and Sharanya S. Rao. "Edge Detection Techniques Using Character Segmentation for OCR of Devanagari Text." Journal of Signal Processing 9, no. 1 (2023): 25–32. http://dx.doi.org/10.46610/josp.2023.v09i01.003.

Full text

Abstract:

An image processing technique called edge detection is used to find and identify the edges, curves, and objects in digital images. Edge detection includes various mathematical calculations that focus on locating the edges and curves where a digital image's brightness abruptly shifts or has discontinuities. In the fields of feature detection and feature extraction in image processing and computer vision, edge detection is a fundamental tool. The application of an edge detector results in the development of a set of connected curves that represent surface marks, character boundaries, and discont

APA, Harvard, Vancouver, ISO, and other styles

45

Ji, Yu Rong, Ying Fang Zhang, and Yu Ge Zheng. "On Edge-Balance Index Sets of the Graph C_n×P_b(n=0,1,2mod6)." Applied Mechanics and Materials 143-144 (December 2011): 750–54. http://dx.doi.org/10.4028/www.scientific.net/amm.143-144.750.

Full text

Abstract:

Let G be a simple graph with vertex set V(G) and edge set E(G), and let Z2=(0,1) For a given binary edge labeling f:E(G)→Z2,the edge labeling f induces a partial vertex labeling f*:V(G)→Z2 such that f*(v)=1(0) iff the number of 1-edges (0-edges) is strictly greater than the number of 0-edges (1-edges) incident to , otherwise f*(v) is undefined. For i∈Z2, let v(i)=card(e∈V(G):f*(v)=i) and e(i)=card(e∈E(G):f(e)=i). The edge-balance index sets of a graph G,EBI(G), is defined as {|v(0)-v(1): the edge labeling f satisfies } . In this paper, we completely determine the edge-balance index |e(0)-e(1)|

APA, Harvard, Vancouver, ISO, and other styles

46

Deepak, Mathur *. Dr. Prabhat Mathur. "EDGE DETECTION TECHNIQUES IN IMAGE PROCESSING WITH ELABORATIVE APPROACH TOWARDS CANNY." INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY 5, no. 6 (2016): 638–43. https://doi.org/10.5281/zenodo.55797.

Full text

Abstract:

Edge is defined as the boundary pixels that connect two separate regions. Edges are local changes in the image intensity. Edges characterize boundaries and are therefore a problem of fundamental importance in image processing.. Edge detection plays a very important role in image processing The edges detected by algorithms are used by advanced computer vision,medical field,Brain Tumor detection,geologic formation extraction,biometrix and many more fields.In this article we are going to survey various edge detection techniques such as sobel, Prewitt, Robert,, Marr Hildrith and Canny operators.Al

APA, Harvard, Vancouver, ISO, and other styles

47

Gu, Yunting, Jinguang Lv, Jian Bo, et al. "An Improved Wavelet Modulus Algorithm Based on Fusion of Light Intensity and Degree of Polarization." Applied Sciences 12, no. 7 (2022): 3558. http://dx.doi.org/10.3390/app12073558.

Full text

Abstract:

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 still cannot accurately obtain edge information for low-contrast images. Therefore, this paper proposes an improved wavelet mode maximum edge algorithm for the fusion of light intensity and degree of polarization. The improved wavelet mode maximum algorithm was used to extract the edges of a light intensity image and degree of polarization imag

APA, Harvard, Vancouver, ISO, and other styles

48

XIANG, LINYING, and GUANRONG CHEN. "MINIMAL EDGE CONTROLLABILITY OF DIRECTED NETWORKS." Advances in Complex Systems 22, no. 07n08 (2019): 1950017. http://dx.doi.org/10.1142/s0219525919500176.

Full text

Abstract:

Minimal edge controllability of directed networks is investigated in this paper. A new edge dynamics model is first introduced with two nonzero parameters describing the linear relationship between the node states and the edge states. Three different digraphs as skeleton structures for minimal edge controllability are analyzed. The conditions ensuring both node controllability and edge controllability for these three digraphs are presented, respectively. It is found that cycles in these networks play an important role in edge controllability. The notion of minimal edge controllability is then

APA, Harvard, Vancouver, ISO, and other styles

49

Li, Yujun, Hongyuan Zhang, and Yuan Yuan. "Edge Contrastive Learning: An Augmentation-Free Graph Contrastive Learning Model." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 17 (2025): 18575–83. https://doi.org/10.1609/aaai.v39i17.34044.

Full text

Abstract:

Graph contrastive learning (GCL) aims to learn representations from unlabeled graph data in a self-supervised manner and has developed rapidly in recent years. However, edge-level contrasts are not well explored by most existing GCL methods. Most studies in GCL only regard edges as auxiliary information while updating node features. One of the primary obstacles of edge-based GCL is the heavy computation burden. To tackle this issue, we propose a model that can efficiently learn edge features for GCL, namely Augmentation-Free Edge Contrastive Learning (AFECL) to achieve edge-edge contrast. AFEC

APA, Harvard, Vancouver, ISO, and other styles

50

Mikolajczyk, Tadeusz, and Łukasz Romanowski. "Optimisation of Single Edge Tools Exploitation Process." Applied Mechanics and Materials 332 (July 2013): 431–36. http://dx.doi.org/10.4028/www.scientific.net/amm.332.431.

Full text

Abstract:

Paper show possibilities to optimization of exploitation process of single edge tools. It decrease cost of machining using optimizing the use of the cutting edge. This possibility was presented for single edge tools in oblique and orthogonal cutting. In oblique cutting was presented optimizing the use of the cutting edge by partially exchange of active section of the cutting edge. It is shown for straight edges. Presents model of special tool and result of made experiments, which shows possibilities to increase tool life. Second presented possibilities is orthogonal cutting with round insert.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!