AI & ChatGPT searches , social queriess for GRAPH INT
Search references for GRAPH INT. Phrases containing GRAPH INT
See searches and references containing GRAPH INT!
Search references for GRAPH INT. Phrases containing GRAPH INT
See searches and references containing GRAPH INT!GRAPH INT
The Genome-based Research and Population Health International Network (GRaPH-Int) is an international collaboration of experts and researchers focused
GRaPH-Int
Longest distance between two vertices
simple linear-time algorithm for computing the center of an interval graph", Int. J. Comput. Math., 34 (3–4): 121–128, doi:10.1080/00207169008803870 Bringmann
Diameter_(graph_theory)
Intersection graph of a chord diagram
In graph theory, a circle graph is the intersection graph of a chord diagram. That is, it is an undirected graph whose vertices can be associated with
Circle_graph
Function type in graph theory
In graph theory and statistics, a graphon (also known as a graph limit) is a symmetric measurable function W : [ 0 , 1 ] 2 → [ 0 , 1 ] {\displaystyle
Graphon
Canadian research centre
Population Health International Network (GraPH-INT) is an international community of population health experts. GRaPH-INT promotes the use of genome-based research
HumGen
Assignment of labels to elements of a graph
discipline of graph theory, a graph labeling is the assignment of labels, traditionally represented by integers, to edges and/or vertices of a graph. Formally
Graph_labeling
Data query language developed by Facebook
or modified. A GraphQL server can process a client query using data from separate sources and present the results in a unified graph. The language is
GraphQL
Path in a graph that visits each vertex exactly once
the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly
Hamiltonian_path
Polynomial-time algorithm for the assignment problem
*/ int cordonBleu(std::istream& is) { int N; int M; is >> N >> M; Vector<Pair<int, int>> B(N); Vector<Pair<int, int>> C(M); Vector<Pair<int, int>> bottles(N);
Hungarian_algorithm
Unproven conjecture in graph theory
on the Erdős–Gyárfás conjecture in planar graphs", Proc. 32nd Southeastern Int. Conf. Combinatorics, Graph Theory, and Computing, pp. 129–139. Heckman
Erdős–Gyárfás_conjecture
Physical simulation to visualize graphs
Force-directed graph drawing algorithms are a class of algorithms for drawing graphs in an aesthetically-pleasing way. Their purpose is to position the
Force-directed_graph_drawing
Academic journal
ISO 4 (alt) · Bluebook (alt) NLM (alt) · MathSciNet (alt ) ISO 4 Int. J. Image Graph. Indexing CODEN (alt · alt2) · JSTOR (alt) · LCCN (alt) MIAR · NLM
International Journal of Image and Graphics
International_Journal_of_Image_and_Graphics
Graphical representation of energy flows in physical systems
A bond graph is a graphical representation of the energy flows though and between physical dynamical systems including those in the electrical, mechanical
Bond_graph
2D graphic with logarithmic scales on both axes
In science and engineering, a log–log graph or log–log plot is a two-dimensional graph of numerical data that uses logarithmic scales on both the horizontal
Log–log_plot
Pictorial representation of the behavior of subatomic particles
device of covariant perturbation theory, the graphs were called Feynman–Dyson diagrams or Dyson graphs, because the path integral was unfamiliar when
Feynman_diagram
Operation in mathematical calculus
the areas of the regions between the graph of f and the x-axis is finite: ∫ E | f | d μ < + ∞ . {\displaystyle \int _{E}|f|\,d\mu <+\infty .} In that case
Integral
Concept in extremal graph theory
In graph theory, an area of mathematics, common graphs belong to a branch of extremal graph theory concerning inequalities in homomorphism densities. Roughly
Common_graph
Graph whose induced subgraphs preserve distance
In graph theory, a branch of discrete mathematics, a distance-hereditary graph (also called a completely separable graph) is a graph in which the distances
Distance-hereditary_graph
Recursive algorithm in graph theory
In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights
Stoer–Wagner_algorithm
Probability of survival beyond any specified time
t f ( u ) d u {\displaystyle S(t)=\int _{t}^{\infty }f(u)\,du=\Pr(T>t)=1-F(t)=1-\int _{0}^{t}f(u)\,du} The graphs below show examples of hypothetical
Survival_function
Measure of distance in physical space
the sphere. In an unweighted graph, the length of a cycle, path, or walk is the number of edges it uses. In a weighted graph, it may instead be the sum
Length
Graph with all vertices of degree 3
of graph theory, a cubic graph is a graph in which all vertices have degree three. In other words, a cubic graph is a 3-regular graph. Cubic graphs are
Cubic_graph
Probability that random variable X is less than or equal to x
x {\displaystyle \operatorname {E} (X)=\int _{0}^{\infty }xf_{X}(x)\,dx\geq \int _{0}^{c}xf_{X}(x)\,dx+c\int _{c}^{\infty }f_{X}(x)\,dx} Then, on recognizing
Cumulative distribution function
Cumulative_distribution_function
Geometric model of the planar projection of the physical universe
Such a drawing is called a plane graph or planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every node to
Euclidean_plane
Algorithmic problem of finding non-crossing drawings
In graph theory, the planarity testing problem is the algorithmic problem of testing whether a given graph is a planar graph (that is, whether it can
Planarity_testing
Object relationship in programming language
use of a friend-class for a graph data structure, where the graph is represented by the main class Graph, and the graph's vertices are represented by
Friend_class
Mapping a graph onto itself without changing edge-vertex connectivity
In the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving
Graph_automorphism
Representation of a computer program
databases and queried using graph query languages. Consider the function of a C program: void foo() { int x = source(); if (x < MAX) { int y = 2 * x; sink(y);
Code_property_graph
Mathematical function with no sudden changes
numbers can be represented by a graph in the Cartesian plane; such a function is continuous if, roughly speaking, the graph is a single unbroken curve whose
Continuous_function
Set of hyperedges where every pair is disjoint
In graph theory, a matching in a hypergraph is a set of hyperedges, in which every two hyperedges are disjoint. It is an extension of the notion of matching
Matching_in_hypergraphs
Unsolved problem in computational complexity theory
computer science Can the graph isomorphism problem be solved in polynomial time? More unsolved problems in computer science The graph isomorphism problem is
Graph_isomorphism_problem
In mechanics, the derivative of the position vs. time graph of an object is equal to the velocity of the object. In the International System of Units
Motion_graphs_and_derivatives
Method of mathematical integration
variable can be regarded, in the simplest case, as the area between the graph of that function and the X axis. The Lebesgue integral, named after French
Lebesgue_integral
Open-source data analytics cluster computing framework
Malak, Michael (14 June 2016). "Finding Graph Isomorphisms In GraphX And GraphFrames: Graph Processing vs. Graph Database". slideshare.net. sparksummit
Apache_Spark
Algorithm in mathematical optimization
flow[i] = (int *) calloc(NODES, sizeof(int)); capacities[i] = (int *) calloc(NODES, sizeof(int)); } // Sample graph capacities[0][1] = 2; capacities[0][2]
Push–relabel maximum flow algorithm
Push–relabel_maximum_flow_algorithm
Automated method for solving mazes
"perfect" mazes, and are equivalent to a tree in graph theory. Maze-solving algorithms are closely related to graph theory. Intuitively, if one pulled and stretched
Maze-solving_algorithm
Study of optimal transportation and allocation of resources
specifically, it is equivalent to finding a minimum weight matching in a bipartite graph. This can be generalized to the continuous case, where there are infinitely
Transportation theory (mathematics)
Transportation_theory_(mathematics)
Indefinite integral
constant of integration. The graphs of antiderivatives of a given function are vertical translations of each other, with each graph's vertical location depending
Antiderivative
Graph metric of electrical resistance between nodes
In graph theory, the resistance distance between two vertices of a simple, connected graph, G, is equal to the resistance between two equivalent points
Resistance_distance
Theorem of convex functions
} at all points (support lines of the graph). Now, if we define x 0 := ∫ Ω g d μ , {\displaystyle x_{0}:=\int _{\Omega }g\,d\mu ,} because of the existence
Jensen's_inequality
Subfield of computer science and mathematics
Symposium on Fundamentals of Computation Theory (FCT) International Workshop on Graph-Theoretic Concepts in Computer Science (WG) ACM Symposium on Parallelism
Theoretical_computer_science
Graph with at most one crossing per edge
In topological graph theory, a 1-planar graph is a graph that can be drawn in the Euclidean plane in such a way that each edge has at most one crossing
1-planar_graph
Logarithm to the base of the mathematical constant e
\infty )} . The natural logarithm can be defined as the area under the graph of a rectangular hyperbola with equation y = 1 / x {\displaystyle y=1/x}
Natural_logarithm
Directed graph where each vertex pair has one arc
In graph theory, a tournament is a directed graph with exactly one edge between each two vertices, in one of the two possible directions. Equivalently
Tournament_(graph_theory)
computer science, a graph-structured stack (GSS) is a directed acyclic graph where each directed path represents a stack. The graph-structured stack is
Graph-structured_stack
Field of electrical engineering
graph. Graph signal processing presents several key points such as sampling signal techniques, recovery techniques and time-varying techiques. Graph signal
Signal_processing
Mathematical function, denoted exp(x) or e^x
algebras. The graph of y = e x {\displaystyle y=e^{x}} is upward-sloping, and increases faster than every power of x {\displaystyle x} . The graph always
Exponential_function
Type of graph in mathematics and physics
mathematics and physics, a quantum graph is a linear, network-shaped structure of vertices connected on edges (i.e., a graph) in which each edge is given a
Quantum_graph
Balanced complete multipartite graph
The Turán graph, denoted by T ( n , r ) {\displaystyle T(n,r)} , is a complete multipartite graph; it is formed by partitioning a set of n {\displaystyle
Turán_graph
Type of graph
In science and engineering, a semi-log plot/graph or semi-logarithmic plot/graph has one axis on a logarithmic scale, the other on a linear scale. It is
Semi-log_plot
Integration method to calculate volume
volume of the solid of revolution: π ∫ a b R ( x ) 2 d x {\displaystyle \pi \int _{a}^{b}R(x)^{2}\,dx} where R(x) is the distance between the function and
Disc_integration
Multi-lobed plane curve
of the sinusoids that specify them. Graphs of roses are composed of petals. A petal is the shape formed by the graph of a half-cycle of the sinusoid that
Rose_(mathematics)
Partition of the vertices of a graph
In graph theory, the Gallai–Edmonds decomposition is a partition of the vertices of a graph into three subsets which provides information on the structure
Gallai–Edmonds_decomposition
Number of "holes" of a surface
surfaces Planar graph: genus 0 Toroidal graph: genus 1 Philadelphia Pretzel graph: Double Toroidal graph: genus 2 Standard Pretzel graph: genus 3 The non-orientable
Genus_(mathematics)
Search algorithm
Monte-Carlo method to bias search into the largest Voronoi regions of a graph in a configuration space. Some variations can even be considered stochastic
Rapidly_exploring_random_tree
Mathematical abstraction of level sets
A Reeb graph (named after Georges Reeb by René Thom) is a mathematical object reflecting the evolution of the level sets of a real-valued function on
Reeb_graph
Software development tool
Deprecated link archived 2012-11-29 at archive.today. Graph model: node class GridNode { food:int; pheromones:int; } node class GridCornerNode extends GridNode;
GrGen
Problem used to illustrate synchronization issues and techniques for resolving them
std; int myrand(int min, int max) { static mt19937 rnd(time(nullptr)); return uniform_int_distribution<>(min,max)(rnd); } void philosopher(int ph, mutex&
Dining_philosophers_problem
Mathematical tree of cycles
In graph theory, a cactus (sometimes called a cactus tree) is a connected graph in which any two simple cycles have at most one vertex in common. Equivalently
Cactus_graph
Functions such that f(–x) equals f(x) or –f(x)
are those real functions whose graph is self-symmetric with respect to the y-axis, and odd functions are those whose graph is self-symmetric with respect
Even_and_odd_functions
Task of computing complete subgraphs
vertices, all adjacent to each other, also called complete subgraphs) in a graph. It has several different formulations depending on which cliques, and what
Clique_problem
Computer programming language
MODE GRAPH = REF GRAPHDATA; PROC new graph = ( ... ) GRAPH : ...; PROC draw graph = (GRAPH g) VOID : ...; ... END KEEP GRAPH, new graph, draw graph FINISH
ALGOL_68-R
Problem of finding the longest simple path for a given graph
In graph theory and theoretical computer science, the longest path problem is the problem of finding a simple path of maximum length in a given graph. A
Longest_path_problem
Fraction of graph maps that are homomorphisms
W)=\int \limits _{[0,1]^{3}}W(x,y)W(y,z)W(z,x)dxdydz} . This definition of homomorphism density is indeed a generalization, because for every graph G {\displaystyle
Homomorphism_density
Extension of the factorial function
) = ∫ 0 ∞ t z − 1 e − t d t , ℜ ( z ) > 0. {\displaystyle \Gamma (z)=\int _{0}^{\infty }t^{z-1}e^{-t}\,dt,\ \qquad \Re (z)>0.} The gamma function then
Gamma_function
Relationship between derivatives and integrals
with the concept of integrating a function (calculating the area under its graph, or the cumulative effect of small contributions). Roughly speaking, the
Fundamental theorem of calculus
Fundamental_theorem_of_calculus
Mathematical constant
graph of the reciprocal Gamma function, 1/Γ(x), and the positive x axis. That is, F = ∫ 0 ∞ 1 Γ ( x ) d x = 2.8077702420285... {\displaystyle F=\int _{0}^{\infty
Fransén–Robinson_constant
Validates computer program operations
#include <stdlib.h> typedef struct { int x; int y; int z; } Coordinates; int parse_coord(Coordinates* coord) { int seen = 0; // remember which attributes
Typestate_analysis
combinatorics and graph theory. The first one extracts information from ϵ {\displaystyle \epsilon } -regular pairs of subsets of vertices in a graph G {\displaystyle
Counting_lemma
Physical process transitioning a system from a symmetric state to a more ordered state
given by the figure with the red graph: consider a particle moving on this graph, subject to gravity. A similar graph could be given by the function f
Symmetry_breaking
Field of study
American Journal of Public Health Community health Nutritional genomics GRaPH-Int Bellagio Group on Public Health Genomics. "Genome-based Research and Population
Public_health_genomics
Curve whose curvature changes linearly
diffraction intensity could be read off a graph of the spiral by squaring the distance between two points on the graph. In his biographical sketch of Cornu
Euler_spiral
Graphics library for Borland compilers on DOS
accessible in C/C++ with graphics.lib / graphics.h, and in Pascal via the graph unit. BGI was less powerful than modern graphics libraries such as SDL or
Borland_Graphics_Interface
Theorem in complex analysis
I_{R}\leq RM_{R}\int _{0}^{\pi }e^{-aR\sin \theta }\,d\theta =2RM_{R}\int _{0}^{\pi /2}e^{-aR\sin \theta }\,d\theta \,.} Since the graph of sin θ is concave
Jordan's_lemma
Integral of the Gaussian function, equal to sqrt(π)
\left(\int _{-\infty }^{\infty }e^{-x^{2}}\,dx\right)^{2}=\int _{-\infty }^{\infty }e^{-x^{2}}\,dx\int _{-\infty }^{\infty }e^{-y^{2}}\,dy=\int _{-\infty
Gaussian_integral
Algorithm for statistical inference on graphical models
We describe here the variant that operates on a factor graph. A factor graph is a bipartite graph containing nodes corresponding to variables V {\displaystyle
Belief_propagation
Method for solving quadratic equations
still taught in elementary algebra courses today. It is also used for graphing quadratic functions, deriving the quadratic formula, and more generally
Completing_the_square
Functional programming language
world!" Factorial: Fibonacci sequence: Infix operator: (^) infixr 8 :: Int Int -> Int (^) x 0 = 1 (^) x n = x * x ^ (n-1) The type declaration states that
Clean_(programming_language)
Numerical integration method
( x ) d x . {\displaystyle \int _{a}^{b}f(x)\,dx.} The trapezoidal rule works by approximating the region under the graph of the function f ( x ) {\displaystyle
Trapezoidal_rule
Abstract from the Genes for Health Meeting, Incorporating the Inaugural GRaPH-Int Conference and the 33rd HGSA Annual Scientific Meeting Fremantle, Australia
List of Annual Scientific Meetings of the Human Genetics Society of Australasia
List_of_Annual_Scientific_Meetings_of_the_Human_Genetics_Society_of_Australasia
Association of one output to each input
is uniquely represented by the set of all pairs (x, f (x)), called the graph of the function, a popular means of illustrating the function. When the
Function_(mathematics)
Free educational programming software
Visual Basic .NET, Python, Matlab) Graphing, creation and edition of flow diagrams Editor with syntax coloring PSeInt official forum Multi-platform software
PSeInt
Statistical principle about ratio of effects to causes
x ) d x {\displaystyle N\int _{x_{a}}^{x_{b}}p(x)dx} and they will be holding: N ∫ x a x b x p ( x ) d x {\displaystyle N\int _{x_{a}}^{x_{b}}x\,p(x)dx}
Pareto_principle
Generalization of closed graph, open mapping, and uniform boundedness theorem
analysis, the Ursescu theorem is a theorem that generalizes the closed graph theorem, the open mapping theorem, and the uniform boundedness principle
Ursescu_theorem
Definite integral of a scalar or vector field along a path
terms of line integrals, in this case W = ∫ L F ( s ) ⋅ d s {\textstyle W=\int _{L}\mathbf {F} (\mathbf {s} )\cdot d\mathbf {s} } , which computes the work
Line_integral
Function in algebraic graph theory
chromatic polynomial is a graph polynomial studied in algebraic graph theory, a branch of mathematics. It counts the number of graph colorings as a function
Chromatic_polynomial
Mathematical function, inverse of an exponential function
shown at the right: a point (t, u = bt) on the graph of f yields a point (u, t = logb u) on the graph of the logarithm and vice versa. As a consequence
Logarithm
Annual academic conference
2024-12-11. Biedl, T. C.; Brandenburg, F. J. (2002), "Graph-drawing contest report", Graph Drawing, 9th Int. Symp., GD 2001, Lecture Notes in Computer Science
International Symposium on Graph Drawing
International_Symposium_on_Graph_Drawing
Decomposition of periodic functions
1 a 2 a 3 {\displaystyle V_{\Gamma }=\int _{\Gamma }d^{3}r=J\int _{0}^{a_{1}}dx_{1}\int _{0}^{a_{2}}dx_{2}\int _{0}^{a_{3}}dx_{3}=J\,a_{1}a_{2}a_{3}}
Fourier_series
Theorem in calculus
{\begin{aligned}\int _{\Omega }u_{x_{i}}\,dV&=\int _{|x'|<r}\int _{g(x')-h}^{g(x')}u_{x_{i}}(x',x_{n})\,dx_{n}\,dx'\\&=\int _{\mathbb {R} ^{n-1}}\int _{-\infty
Divergence_theorem
Primary time standard globally used to regulate clocks and time
then added). In the graph of DUT1 above, the excess of LOD above the nominal 86,400 s corresponds to the downward slope of the graph between vertical segments
Coordinated_Universal_Time
On converting relations to functions of several real variables
by F ( x , y ) = 0 {\displaystyle F(x,y)=0} can also be specified as the graph of a function f {\displaystyle f} , so that for each point ( x , y ) {\displaystyle
Implicit_function_theorem
a b f ( x ) d x {\displaystyle \int _{a}^{b}f(x)\,dx} is the area of the region in the xy-plane bounded by the graph of f, the x-axis, and the lines x
List_of_definite_integrals
Family of graphs based on the Fibonacci sequence
In the mathematical field of graph theory, the Fibonacci cubes or Fibonacci networks are a family of undirected graphs with rich recursive properties
Fibonacci_cube
Cycles in a graph that generate all cycles
In graph theory, a branch of mathematics, a cycle basis of an undirected graph is a set of simple cycles that forms a basis of the cycle space of the
Cycle_basis
Instantaneous rate of change (mathematics)
chosen input value, when it exists, is the slope of the tangent line to the graph of the function at that point. The tangent line is the best linear approximation
Derivative
Generalized function whose value is zero everywhere except at zero
distributions, where it is defined as a linear form acting on functions. The graph of the Dirac delta is usually thought of as following the whole x {\displaystyle
Dirac_delta_function
Mathematics problem
polynomial time to within the approximation factor 1.375. An n-pancake graph is a graph whose vertices are the permutations of n symbols from 1 to n and its
Pancake_sorting
Graph of n vertices with a perfect matching for every subgraph of n-1 vertices
In graph theory, a mathematical discipline, a factor-critical graph (or hypomatchable graph) is a graph with an odd number of vertices in which deleting
Factor-critical_graph
Branch of mathematics
line: it gives a way to quantify the steepness of the graph of a function, even when that graph is not a straight line. In Lagrange's notation, the symbol
Calculus
GRAPH INT
GRAPH INT
Boy/Male
Muslim
Grape
Boy/Male
Biblical
A grape, a knot.
Girl/Female
Arabic, Assamese, Hindu, Indian, Kannada, Malayalam, Marathi, Muslim, Telugu
Grape
Girl/Female
Indian
Grape vine
Boy/Male
Biblical
A grape, a knot.
Boy/Male
Hindu, Indian
Efficient; Conqueror of Miseries; Bond in Affection; Capable; Mysterious; Different than Others; Smart; Most Mysterious Vastu Grah 'Rahu'; Son of Lord Buddha; Son of Goddess Durga; Truth Follower; Best of All
Boy/Male
African, Arabic
Grape Vines
Boy/Male
Hebrew, Hindu, Indian, Marathi
Grape Cluster
Boy/Male
Indian
Grape
Girl/Female
Hindu
Grape, Belonging to kashmir
Girl/Female
Afghan, Arabic, Hebrew, Indian, Muslim, Parsi, Sanskrit
Grape Presser; World; Song; Universe
Girl/Female
Indian
Grape like
Girl/Female
Muslim
Grape vine
Boy/Male
Arabic, Modern
Grape
Boy/Male
Hindu, Indian, Punjabi, Sikh
From Kashmir; Grape
Biblical
a grape; a knot
Girl/Female
Tamil
Kaslunira | கஸà¯à®²à¯à®‚நீரா
Grape, Belonging to kashmir
Kaslunira | கஸà¯à®²à¯à®‚நீரா
Boy/Male
Afghan, Hebrew, Indian, Parsi, Sanskrit
Grape Presser; World; Song
Female
Thai/Siamese
Thai name A-GUN means "grape."
Girl/Female
Muslim
Grape like
GRAPH INT
GRAPH INT
Boy/Male
German, Greek
Hospitality; Stranger
Girl/Female
Indian
Lady.
Surname or Lastname
English
English : habitational name from a place in West Sussex, seat of the Dukes of Norfolk, named Arundel, from Old English hÄrhÅ«ne ‘horehound’ (a plant) + dell ‘valley’.English : nickname for someone supposedly resembling a swallow, from Old French arondel, diminutive of arond ‘swallow’ (Latin hirundo, confused with (h)arundo ‘reed’).
Girl/Female
Bengali, Gujarati, Hindu, Indian, Kannada, Marathi, Telugu
Moonlight; Lord Vishnu
Girl/Female
Muslim/Islamic
Captivating alluring, intelligent
Girl/Female
Biblical
Guardian, thorn.
Boy/Male
Anglo Saxon
Swift.
Boy/Male
Indian, Telugu
Lord Vishnu
Girl/Female
Hindu, Indian
Learned
Girl/Female
Assamese, Bengali, Gujarati, Hindu, Indian, Kannada, Malayalam, Marathi, Sanskrit, Telugu
Knowledge of Truth
GRAPH INT
GRAPH INT
GRAPH INT
GRAPH INT
GRAPH INT
a.
Composed of, or resembling, grapes.
n.
Grapeshot.
n.
A grape of many varieties and colors.
a.
Resembling a grape.
n.
A grape dried in the sun; a raisin.
n.
A grape, or a bunch of grapes.
n.
A mangy tumor on the leg of a horse.
n.
A seed of the grape.
n.
The cultivation of the vine; grape growing.
n.
A variety of shaddock, called also grape fruit.
n.
A sort of grape.
n.
A white grape, esteemed for the table.
n.
The Hartford grape, a variety of grape first raised at Hartford, Connecticut, from the Northern fox grape. Its large dark-colored berries ripen earlier than those of most other kinds.
n.
A plant of the genus Muscari; grape hyacinth.
n.
See Grasshopper, and Frog hopper, Grape hopper, Leaf hopper, Tree hopper, under Frog, Grape, Leaf, and Tree.
a.
Full of small kernels like a grape.
n.
A well-known edible berry growing in pendent clusters or bunches on the grapevine. The berries are smooth-skinned, have a juicy pulp, and are cultivated in great quantities for table use and for making wine and raisins.
n.
The plant which bears this fruit; the grapevine.