Results 261 to 270 of about 750,580 (290)
Artificial Intelligence-Based Analysis of Coronary Atherosclerotic Plaque on Intravascular Ultrasound: A Systematic Review and Meta-Analysis. [PDF]
Clin CardiolEini P +3 more
europepmc +1 more source
Shadow Graphs and 3D Texture Reconstruction
International Journal of Computer Vision, 2005 We present methods for recovering surface height fields such as geometric details of 3D textures by incorporating shadow constraints. We introduce shadow graphs which give a new graph-based representation for shadow constraints. It can be shown that the shadow graph alone is sufficient to solve the shape-from-shadow problem from a dense set of images ...
Chang, JT, Yu, Y
exaly +8 more sources
Open Global Shadow Graph and It’s Zero Forcing Number
Proyecciones, 2023 Zero forcing number of a graph is the minimum cardinality of the zero forcing set. A zero forcing set is a set of black vertices of minimum cardinality that can colour the entire graph black using the color change rule: each vertex of G is coloured ...
Charles Dominic
exaly +2 more sources
Journal of Combinatorial Theory - Series A, 2011 23 ...
Robert Morris, Béla Bollobás
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On the domination number of a graph and its shadow graph
Discrete Mathematics, Algorithms and Applications, 2021Let [Formula: see text] be a graph. A subset [Formula: see text] of [Formula: see text] is called a dominating set of [Formula: see text] if every vertex not in [Formula: see text] is adjacent to some vertex in [Formula: see text]. The domination number [Formula: see text] of [Formula: see text] is the minimum cardinality taken over all dominating ...
E. Murugan, G. R. Sivaprakash
openaire +3 more sources
Shadow Graphs and Surface Reconstruction [PDF]
Lecture Notes in Computer Science, 2002 We present a method to solve shape-from-shadow using shadow graphs which give a new graph-based representation for shadow constraints. It can be shown that the shadow graph alone is enough to solve the shape-from-shadow problem from a dense set of images.
Yizhou Yu, Johnny T. Chang
exaly +2 more sources
On sombor index of m-shadow graph of some graphs
Kongunadu Research Journal, 2022This new topological invariant is applied in the areas of chemical graph theory. In this paper we have obtained the Sombor index of m−shadow graphs of path graph Dm(Pn), cycle graph Dm(Cn), ladder graph Dm(Ln) and tadpole graph Dm(Tn,p). We have also concluded that, the Sombor index of m-shadow graph of any regular or finite connected graph G is SO(G ...
null Abirami K, null Mohanapriya N
openaire +1 more source
On the Geodetic and Hull Numbers of Shadow Graphs
2020Given two vertices u, v in a graph G, a shortest (u, v)-path in G is called an (u, v)-geodesic. Let \(I_G[u, v]\) denote the set of all vertices in G lying on some (u, v)-geodesic. Given a set \(T\subseteq V(G)\), let \(I_G[T]=\cup _{u,v \in T}I_G[u, v]\). If \(I_G[T]=T\), we call T a convex set. The convex hull, denoted by \(\langle T \rangle _G\), is
S. V. Ullas Chandran +2 more
openaire +2 more sources
Dominator Chromatic Number of m-Splitting Graph and m-Shadow Graph of Path Graph
International Journal of Biomedical Engineering and Technology, 2018Graph theory techniques are applied to several biological domains. The application of graph colouring and domination in the field of biology and medicine includes identifying drug targets, determining the role of proteins, genes of unknown function. The area obtained by combining graph colouring and domination is called the dominator colouring of a ...
R Rajeswari
exaly +2 more sources
Grundy Edge Coloring of Shadow Graph of Some Graphs
International Journal of Applied MathematicsAn edge coloring of a graph G refers to the process of assigning colors to the edges such that any two edges sharing a common vertex receive different colors. The Grundy edge chromatic number, denoted by (G), is defined as the largest number of colors that can be used by a greedy edge-coloring procedure across all permutations of the edges.
exaly +2 more sources