Results 81 to 90 of about 140,706 (235)
An enriched cryptosystem based Polybius cipher using graph labeling techniques [PDF]
, 2022 B. Deepa, V. Uma Maheswari
openalex +1 more source
Taiwanese Journal of Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chia, Ma-Lian +4 more
openaire +2 more sources
Heuristics based on greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem [PDF]
, 2007 This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree using edges that are as similar as possible.
Consoli, S +3 more
core
Few Long Lists for Edge Choosability of Planar Cubic Graphs [PDF]
, 2012 It is known that every loopless cubic graph is 4-edge choosable. We prove the following strengthened result. Let G be a planar cubic graph having b cut-edges. There exists a set F of at most 5b/2 edges of G with the following property. For any function
Goddyn, Luis, Spencer, Andrea
core
New Algebraic Groups Produced By Graphical Passwords Based On Colorings And Labellings
MATEC Web of Conferences, 2017 Safety of plain text passwords has been questioned in current researching information passwords. Graphical passwords are another way for alternative text-based passwords and to improve the user account security.
Sun Hui +3 more
doaj +1 more source
Intuitionistic fuzzy labeling graphs
, 2018 In this paper, some new connectivity concepts in intuitionistic fuzzy labeling graphs are defined. The concepts of strong arc, partial cut node, bridge and block are introduced. Also, intuitionistic fuzzy labeling tree is defined and investigated many interesting properties. Finally, partial intuitionistic fuzzy labeling tree is defined and established
SAHOO, S., PAL, M.
openaire +2 more sources
Total Edge Irregularity Strength for Graphs
, 2017 An edge irregular total $k$-labelling $f : V(G)\cup E(G)\rightarrow \{1,2,\dots,k\}$ of a graph $G$ is a labelling of the vertices and the edges of $G$ in such a way that any two different edges have distinct weights.
Irwansyah, M, Salman A. N.
core
Leveraging convolutional and graph networks for an unsupervised remote sensing labelling tool
Annals of GISMachine learning for remote sensing imaging relies on up-to-date and accurate labels for model training and testing. Labelling remote sensing imagery is time and cost intensive, requiring expert analysis.
Tulsi Patel +2 more
doaj +1 more source
Labelling the axes of graphs … [PDF]
Nature, 1985 Nature 316, 489 (1985). IN this Scientific Correspondence contribution, the third paragraph should begin: 'The example quoted above requires the observation that if "Radioactivity = 5 x 103 c.p.m." then "5 = (Radioactivity ? l(T3)/c.p.m." or "5 = 103 (Radioactivity/c.p.m.)" or "5 = Radioactivity/(C.p.
openaire +1 more source
Extensions of the minimum labelling spanning tree problem
Journal of Telecommunications and Information Technology, 2006 In this paper we propose some extensions of the minimum labelling spanning tree problem. The main focus is on the minimum labelling Steiner tree problem: given a graph G with a color (label) assigned to each edge, and a subset Q of the nodes of G (basic
Raffaele Cerulli +2 more
doaj +1 more source