AI & ChatGPT searches , social queries for IMPLICATION GRAPH
Search references for IMPLICATION GRAPH. Phrases containing IMPLICATION GRAPH
See searches and references containing IMPLICATION GRAPH!
Search references for IMPLICATION GRAPH. Phrases containing IMPLICATION GRAPH
See searches and references containing IMPLICATION GRAPH!IMPLICATION GRAPH
Directed graph representing a Boolean expression
In mathematical logic and graph theory, an implication graph is a skew-symmetric, directed graph G = (V, E) composed of vertex set V and directed edge
Implication_graph
Logic problem, AND of pairwise ORs
type of directed graph, the implication graph, which expresses the variables of an instance and their negations as vertices in a graph, and constraints
2-satisfiability
Topics referred to by the same term
other Implication table, a tool used to facilitate the minimization of states in a state machine Implication graph, a skew-symmetric directed graph used
Implication
Directed graph isomorphic to its own transpose graph
the implication graphs used to efficiently solve the 2-satisfiability problem. As defined, e.g., by Goldberg & Karzanov (1996), a skew-symmetric graph G
Skew-symmetric_graph
SAT solving algorithm
resulting graph is called an implication graph. Arbitrarily pick another branching variable, x3. Apply unit propagation and find the new implication graph. Here
Conflict-driven clause learning
Conflict-driven_clause_learning
Area of discrete mathematics
computer science, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context
Graph_theory
Partition of a graph whose components are reachable from all vertices
In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex. The strongly
Strongly_connected_component
Unrelated vertices in graphs
finding a maximum independent set of a graph. Every maximum independent set also is maximal, but the converse implication does not necessarily hold. A set is
Independent set (graph theory)
Independent_set_(graph_theory)
Class of artificial neural networks
Graph neural networks (GNNs) are artificial neural networks designed for tasks whose inputs are graphs. Because graphs usually do not have a canonical
Graph_neural_network
Type of knowledge base
knowledge graph is a knowledge base that uses a graph-structured data model or topology to represent and operate on data. Knowledge graphs are often used
Knowledge_graph
Type of search algorithm
green clauses becomes True After making several decisions, we find an implication graph that leads to a conflict. Now backtrack to immediate level and by
DPLL_algorithm
Directed graph with reversed edges
taking the converse of an implication in logic. The name transpose is because the adjacency matrix of the transpose directed graph is the transpose of the
Transpose_graph
Logical connective
implication) is a binary operation commonly used in logic. When the conditional symbol → {\displaystyle \to } is interpreted as material implication,
Material_conditional
Two closely related models for generating random graphs
that a graph sampled from G(n, M) has property P tends to a as n → ∞. Then the probability that G(n, p) has property P also tends to a. Implications in the
Erdős–Rényi_model
Unproven generalization of the four-color theorem
the implication, the conjecture can equivalently be stated in the following form. According to it, if all proper colorings of an undirected graph G {\displaystyle
Hadwiger conjecture (graph theory)
Hadwiger_conjecture_(graph_theory)
Equivalence of distributive lattices and set families
lower sets of the transitive closure of the graph. Equivalently, for a distributive lattice, the implication graph of the 2-satisfiability instance can be
Birkhoff's representation theorem
Birkhoff's_representation_theorem
Statement in mathematical combinatorics
its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling (with colours) of a sufficiently large complete graph. As
Ramsey's_theorem
Logical formulation of graph properties
the mathematical fields of graph theory and finite model theory, the logic of graphs deals with formal specifications of graph properties using sentences
Logic_of_graphs
Graph in climate science
Hockey stick graphs present global or hemispherical mean global surface temperatures of the distant past, as shown by quantitative climate reconstructions
Hockey stick graph (global temperature)
Hockey_stick_graph_(global_temperature)
Graph representing social relations
social graph is a graph that represents social relations between entities. It is a model or representation of a social network. The social graph has been
Social_graph
Generalization of graph theory
hypergraph is a generalization of a graph in which an edge can join any number of vertices. In contrast, in an ordinary graph, an edge connects exactly two
Hypergraph
Finiteness of sets of forbidden graph minors
graph theory, the Robertson–Seymour theorem (also called the graph minors theorem) states that the undirected graphs, partially ordered by the graph minor
Robertson–Seymour_theorem
On graphs with given symmetry groups
symmetries of an infinite graph; alternatively, the axiom of regularity eliminates the need for choice. Furthermore, this implication is strict, as there are
Frucht's_theorem
Theorem in graph theory
pairwise edge-disjoint paths from x to y. The implication for the graph G is the following version: A graph is k-edge-connected (it remains connected after
Menger's_theorem
Fair division protocol
the implication graph are dependent. but thanks to the semi-final selection phase, we can prove that the probability that the implication graph contains
Edmonds–Pruhs_protocol
Graph obeys some properties of random graphs
In graph theory, a graph is said to be a pseudorandom graph if it obeys certain properties that random graphs obey with high probability. There is no concrete
Pseudorandom_graph
Planar maps require at most four colors
terms of graph theory, by considering it in terms of constructing a graph coloring of the planar graph of adjacencies between regions. In graph-theoretic
Four_color_theorem
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
Directed graph that models causal relationships between variables
inference tools, the graphs enable researchers to estimate effect sizes from non-experimental data, derive testable implications of the assumptions encoded
Causal_graph
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
Computational Formula that can be measured in terms of True or False
time, by an algorithm involving strong connectivity analysis of its implication graph. The 2-satisfiability problem is a special case of TQBF for these
True quantified Boolean formula
True_quantified_Boolean_formula
On coloring the edges of graphs
In graph theory, Vizing's theorem states that every simple undirected graph may be edge colored using a number of colors that is at most one larger than
Vizing's_theorem
Hungarian mathematician (1913–1996)
20th century. Erdős pursued and proposed problems in discrete mathematics, graph theory, number theory, mathematical analysis, approximation theory, set
Paul_Erdős
Pan-genome Graph Construction Methodology
Pan-genome graph construction is the process of creating a graph-based representation of the collective genome (the pan-genome) of a species or a group
Pan-genome_graph_construction
On short connecting nets with added points
term Steiner tree problem, is the Steiner tree problem in graphs. Given an undirected graph with non-negative edge weights and a subset of vertices, usually
Steiner_tree_problem
Result in combinatorics and graph theory
equivalent for a bipartite graph G = (X+Y, E): G admits an X-perfect matching. G admits an X-perfect fractional matching. The implication follows directly from
Hall's_marriage_theorem
Knowledge management software
knowledge elements can be structured and interrelated (as a tree, graph, tree plus graph, spatially, categorically, as n-ary links, chronologically, or ZigZag);
Personal_knowledge_base
Relationship where one statement follows from another
Logical consequence (also entailment or logical implication) is a fundamental concept in logic which describes the relationship between statements that
Logical_consequence
Subset of a graph's nodes such that all other nodes link to at least one
In graph theory, a dominating set for a graph G is a subset D of its vertices, such that any vertex of G is in D, or has a neighbor in D. The domination
Dominating_set
Concept in mathematical logic
converse of a categorical or implicational statement is the result of reversing its two constituent statements. For the implication P → Q, the converse is Q
Converse_(logic)
On forbidden subgraphs in planar graphs
In graph theory, Kuratowski's theorem is a mathematical forbidden graph characterization of planar graphs, named after Kazimierz Kuratowski. It states
Kuratowski's_theorem
Every graph has evenly many odd vertices
In graph theory, the handshaking lemma is the statement that, in every finite undirected graph, the number of vertices that touch an odd number of edges
Handshaking_lemma
Mathematically obvious
material implication P→Q, where the consequent Q, is always true. Here, the proof follows immediately by virtue of the definition of material implication in
Triviality_(mathematics)
Structuring text as input to generative artificial intelligence
frequent retraining. GraphRAG (coined by Microsoft Research) is a technique that extends RAG with the use of a knowledge graph to allow the model to
Prompt_engineering
and Engineering (CSSE) at Johns Hopkins University. Data for the map and graphs is from the COVID-19 Data Repository by the Center for Systems Science and
COVID-19 pandemic by country and territory
COVID-19_pandemic_by_country_and_territory
services Facebook Features Bluetooth Beacon Dating Feed EdgeRank Reels Gaming Graph Search Instant Articles Like button Live Lookalike audience Onion address
Meta_smart_glasses
Popularity analysis of search queries
regions, time ranges, and categories. The website uses timeline and average graphs to compare the relative search interest of compared queries over a certain
Google_Trends
Unsolved problem in computer science
(2006). "Graph isomorphism is in SPP". Information and Computation. 204 (5): 835–852. doi:10.1016/j.ic.2006.02.002. Schöning, Uwe (1988). "Graph isomorphism
P_versus_NP_problem
Network whose degree distribution follows a power law
Willinger, W. (2005). "Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications (Extended Version)". arXiv:cond-mat/0501169. Kumar
Scale-free_network
conjecture, if true, would have numerous implications in graph theory, including the 1-factorization conjecture. For graphs in which Δ ≥ n / 3 {\displaystyle
Overfull_graph
American physicist and climatologist
reconstruction over the past 1,000 years (MBH99), which was dubbed the "hockey stick graph" because of its shape. He was one of eight lead authors of the "Observed
Michael_E._Mann
Format for expressing RDF statements in HTML documents
annotate data in web pages Open Graph protocol, a way to use RDFa to integrate web pages into the Facebook social graph Schema.org, search-engine supported
RDFa
Measure of the structural complexity of a software program
Cyclomatic complexity is computed using the control-flow graph of the program. The nodes of the graph correspond to indivisible groups of commands of a program
Cyclomatic_complexity
Theorem about a certain class of control-flow graphs
generally called the Böhm–Jacopini theorem, states that a class of control-flow graphs (historically called flowcharts in this context) can compute any computable
Structured_program_theorem
Terms to describe a conditional relationship between two statements
necessity and sufficiency are concepts used to denote a conditional or implicational relationship between two statements. For example, in the conditional
Necessity_and_sufficiency
biconditional Logical conjunction Logical disjunction Logical equality Logical implication Logical negation Logical NOR Majority function Material conditional Minimal
List of Boolean algebra topics
List_of_Boolean_algebra_topics
Quality of zero being an even number
at its tip alternates between outside and inside. In graph theory, a bipartite graph is a graph whose vertices are split into two colors, such that neighboring
Parity_of_zero
Mathematical table used in logic
negation is Russell's, alongside of which is the matrix for material implication in the hand of Ludwig Wittgenstein. It is shown that an unpublished manuscript
Truth_table
Professional network website
analytics Inspired by Facebook's "social graph", LinkedIn CEO Jeff Weiner set a goal in 2012 to create an "economic graph" within a decade. The goal was to create
Part of speech that conveys an action
so far makes some form of noun-verb distinction, possibly because of the graph-like nature of communicated meaning by humans, i.e. nouns being the "entities"
Verb
Video-sharing platform
Heffernan stated in The New York Times that such videos have "surprising implications" for the dissemination of culture and even the future of classical music
YouTube
In statistics and Markov modeling, an ancestral graph is a type of mixed graph used to provide a graphical representation for the result of marginalizing
Ancestral_graph
Conjecture in graph theory
In graph theory, Hedetniemi's conjecture, formulated by Stephen T. Hedetniemi in 1966, concerns the connection between graph coloring and the tensor product
Hedetniemi's_conjecture
Type of computer science algorithm
one wishes to know if two vertices in a graph of n vertices are in the same connected component of the graph, there is no known simple, deterministic
In-place_algorithm
Wear and tear on the body due to stress
status of homeostasis and the extended stress response has negative implications. The human body regulates itself to maintain a status of homeostasis
Allostatic_load
Economic model showing fair trading leads to inequality
with anyone, instead allowing trades only between people connected in a graph. Computer simulations on one-dimensional rings, two-dimensional grids, and
Yard-sale_model
Geometrical smooth strip
modeling and in material science. Bollobás–Riordan polynomial Knots and graphs Knot theory DNA supercoil Möbius strip Blaschke, W. (1950) Einführung in
Ribbon_(mathematics)
Graph in which all neighbors of every vertex have distinct degrees
In graph theory, a highly irregular graph is a graph in which, for every vertex, all neighbors of that vertex have distinct degrees. Irregular graphs were
Highly_irregular_graph
Optimization algorithms using quantum computing
vertex cover of a graph. The goal here is to find a minimum vertex cover of a graph: a collection of vertices such that each edge in the graph contains at least
Quantum optimization algorithms
Quantum_optimization_algorithms
Conjecture in probabilistic combinatorics
mathematics that studies the behavior of connected clusters in a random graph. The conjecture is named after its analogy to a bunk bed structure. It was
Bunkbed_conjecture
NP-hard problem in combinatorial optimization
version of the TSP (where given a length L, the task is to decide whether the graph has a tour whose length is at most L) belongs to the class of NP-complete
Travelling_salesman_problem
Proposition that visual inscriptions are central to scientific practice
presentation, with tables occupying more space than graphs. The graphism thesis has implications for several areas within the philosophy of science and
Graphism_thesis
Equivalence of optimization problems
notions must first be defined. A network consists of a finite directed graph G = (V, E), where V denotes the finite set of vertices and E ⊆ V×V is the
Max-flow_min-cut_theorem
Binary relation over a set and itself
endorelations. Terminology particular for graph theory is used for description, with an ordinary (undirected) graph presumed to correspond to a symmetric
Homogeneous_relation
Formal language used to prove statements
display logic, hypersequents, the calculus of structures, and bunched implication. Method of analytic tableaux Proof procedure Propositional proof system
Proof_calculus
Measure of a graph's centrality, based on shortest paths
In graph theory, betweenness centrality is a measure of centrality in a graph based on shortest paths. Betweenness centrality measures how frequently a
Betweenness_centrality
In logic, a statement which is always true
{\displaystyle R} to be true, and so the definition of tautological implication is trivially satisfied. Similarly, if S {\displaystyle S} is a tautology
Tautology_(logic)
Dopaminergic medication
oral administration of levodopa with large fluctuations (see the schematic graph figure). On the other hand, in a disease like Segawa syndrome, in which
Levodopa
Unproven computational hardness assumption
graph k-colorability, finding Hamiltonian cycles, maximum cliques, maximum independent sets, and vertex cover on n {\displaystyle n} -vertex graphs.
Exponential_time_hypothesis
-dimensional normed vector space is a property of graphs which states that any embedding, or drawing, of the graph in some high dimension d ′ {\displaystyle d'}
Graph_flattenability
Hypothetical event
want to go back to, is we really have to think through the economic implications. Because most people aren't spending a lot of time right now worrying
Technological_singularity
Checking software against expectations
IBM study (Fagan's paper) contains claims that seem to contradict Boehm's graph and no numerical results that clearly correspond to his data points. Boehm
Software_testing
Mathematical group that can be generated as the set of powers of a single element
graph is a cycle graph, and for an infinite cyclic group with its generator the Cayley graph is a doubly infinite path graph. However, Cayley graphs can
Cyclic_group
On forbidden minors in planar graphs
In graph theory, Wagner's theorem is a mathematical forbidden graph characterization of planar graphs, named after Klaus Wagner, stating that a finite
Wagner's_theorem
President of the United States (2017–2021; since 2025)
Balz, Dan (May 29, 2021). "The GOP push to revisit 2020 has worrisome implications for future elections". The Washington Post. Retrieved June 18, 2021.
Donald_Trump
Argumentation scheme
The basic structure of IBIS is a graph. It is therefore quite suitable to be manipulated by computer, as in a graph database. The elements of IBIS are:
Issue-based information system
Issue-based_information_system
water. The lanthanides are especially difficult to measure accurately. Graphs of abundance against atomic number can reveal patterns relating abundance
Abundance of elements in Earth's crust
Abundance_of_elements_in_Earth's_crust
Cosmological fine-tuning problem
ISBN 978-0-470-84835-7. Ryden p. 168 Stompor, Radek; et al. (2001). "Cosmological Implications of the MAXIMA-1 High-Resolution Cosmic Microwave Background Anisotropy
Flatness_problem
Sign language predominantly in the US
Unicode Standard. SignWriting consists of more than 5000 distinct iconic graphs/glyphs. Currently, it is in use in many schools for the deaf, particularly
American_Sign_Language
Limitative results in mathematical logic
formal system known as primitive recursive arithmetic, which proves the implication Con(F)→GF, where Con(F) is a canonical sentence asserting the consistency
Gödel's incompleteness theorems
Gödel's_incompleteness_theorems
Exactly solvable model of coupled oscillators
way. A graph with the minimal degree at least d min ≥ 0.5 n {\displaystyle d_{\text{min}}\geq 0.5\,n} will be connected nevertheless for a graph to synchronize
Kuramoto_model
Sequence of data points over time
mathematics, a time series is a sequence of data points indexed, listed, or graphed in chronological order. Most commonly, a time series consists of observations
Time_series
Clustering methods
k-means in the eigenspace defined by the graph Laplacian. This theoretical insight has practical implications: the final clustering step in spectral clustering
Spectral_clustering
NoSQL document-oriented database
language, (RQL), and includes native features for handling time series, graph querying, and full-text search. It is cross-platform, supported on Windows
RavenDB
Square matrix without an inverse
or apply forces in certain directions. In graph theory and network physics, the Laplacian matrix of a graph is inherently singular (it has a zero eigenvalue)
Singular_matrix
Marketing of products or services using digital technologies or digital tools
Ellis-Chadwick, Fiona (September 2000). "Retailer adoption of the Internet – Implications for retail marketing". European Journal of Marketing. 34 (8): 954–974
Digital_marketing
from graph theory. For instance, a classical algorithm for testing whether a graph is bipartite would simply output a Boolean value: true if the graph is
Certifying_algorithm
Transforming data by taking the logarithm
that is to be applied, or to improve the interpretability or appearance of graphs. The log transform is invertible, continuous, and monotonic. The transformation
Log transformation (statistics)
Log_transformation_(statistics)
Property of a mathematical operation
Transformation rules Propositional calculus Rules of inference (List) Implication introduction / elimination (modus ponens) Biconditional introduction /
Associative_property
Unsolved problem in mathematics
problems and bounds on properties, related to chromatic numbers, of certain graphs. Consider n {\displaystyle n} runners on a circular track of unit length
Lonely_runner_conjecture
IMPLICATION GRAPH
IMPLICATION GRAPH
Surname or Lastname
English (of Norman origin) and French
English (of Norman origin) and French : from Old French voisin ‘neighbor’ (Anglo-Norman French veisin) . The application is uncertain; it may be a nickname for a ‘good neighbor’, or for someone who used this word as a frequent term of address, or it may be a topographic name for someone who lived on a neighboring property.
Surname or Lastname
English
English : presumably from Old French joint ‘united’, ‘joined’. The application as a surname is unclear.
Boy/Male
Italian Spanish
Enduring. The poet Dante Alighieri wrote The Divine Comedy with its graphic description of...
Surname or Lastname
English
English : from Middle English, Old French branche ‘branch’ (Late Latin branca ‘foot’, ‘paw’), the application of which as a surname is not clear. In America it has been adopted as a translation of any of the numerous Swedish surnames containing the element gren ‘branch’, and likewise of French Labranche, German Zweig, and Finnish Haara, Oksa, and Oksana.
Boy/Male
Hindu, Indian
Application
Surname or Lastname
English
English : variant of Perrier 1 and 2.American bearers of the surname include Bennet Puryear (1826–1914), born in Mecklenburg Co., VA, youngest son of Thomas and Elizabeth (Marshall) Puryear, who studied medicine and chemistry before the Civil War, after which he became a professor of chemistry; he did pioneering work in the application of chemistry to agriculture. He had 11 children by his two wives.
Boy/Male
Spanish American Italian Latin
Enduring. The poet Dante Alighieri wrote The Divine Comedy with its graphic description of...
Surname or Lastname
English and German
English and German : from a Germanic personal name, either a short form of compound names such as Billard, or else a byname Bill(a), from Old English bil ‘sword’, ‘halberd’ (or a Continental cognate). (Bill as a short form of William was not used until the 17th century.)English : metonymic occupational name for a maker of pruning hooks and similar implements, from Middle English bill, from Old English bil ‘sword’, with the meaning shifted to a more peaceful agricultural application (see Biller 5).
Surname or Lastname
English
English : nickname for a tall, thin man, from Middle English spir ‘stalk’, ‘stem’. This was apparently used as a personal name or byname, in view of the fact that there are patronymic derivatives. In some Middle English dialects this word also denoted reeds, and the surname may in part have been originally a topographic name for someone who lived in a marshy area. The application to a church steeple is not attested before the 16th century, and is not a likely source of the surname.Jewish (Ashkenazic) : variant of Spiro.
Surname or Lastname
English
English : variant spelling of Job.English : nickname from Old French job, joppe ‘sorry wretch’, ‘fool’ (perhaps a transferred application of the name of the Biblical character).English : from Middle English jubbe, jobbe ‘vessel containing four gallons’, hence perhaps a metonymic occupational name for a cooper. It could also have been a nickname for a heavy drinker or for a tubby person.English : metonymic occupational name for a maker or seller (or nickname for a wearer) of the long woolen garment known in Middle English and Old French as a jube or jupe. This word ultimately derives from Arabic.
Surname or Lastname
English (Warwickshire)
English (Warwickshire) : apparently a variant of Gourley or Gorley.Possibly an Americanized spelling of French Gourlé, from Old French gourle ‘money belt’. Its application as a surname is not clear; it may have been a metonymic occupational name for a maker of such receptacles, or perhaps a nickname for someone who was tight with his money.Alternatively, it may be an Americanized form of German Gerling or Gerlich.
Surname or Lastname
Irish (County Donegal)
Irish (County Donegal) : Anglicized form of Gaelic Ó Duibhidhir or sometimes of Mac Duibhidhir (see Dwyer, also Dyer).English : of uncertain derivation; possibly from diver, an agent derivative of Middle English dive ‘to dip or plunge’, but if so the application is obscure. It may be a nickname for someone compared to a diving bird. Compare Ducker.
Boy/Male
Italian Spanish
Enduring. The poet Dante Alighieri wrote The Divine Comedy with its graphic description of...
Surname or Lastname
English
English : apparently a nickname from Middle English to ‘exceedingly’ + gode ‘good’, perhaps ironic in application.
Surname or Lastname
English
English : nickname from Middle English derth ‘famine’ (of uncertain application) or de(e)th ‘death’, Old English dēa{dh}. The latter name would have been acquired by someone who had played the part of the personified figure of Death in a pageant or play, or else one who was habitually gloomy or sickly, and the insertion of the letter -r- may have been a deliberate attempt to dissociate the name from death.
Girl/Female
African, Anglo, British, Chinese, English, German, Hebrew, Swahili
To Tangle; Complication; Difficulty; Fairy Princess
Surname or Lastname
German (also Gräff), Dutch, and Jewish (Ashkenazic)
German (also Gräff), Dutch, and Jewish (Ashkenazic) : variant of Graf.English : metonymic occupational name for a clerk or scribe, from Anglo-Norman French grafe ‘quill’, ‘pen’ (a derivative of grafer ‘to write’, Late Latin grafare, from Greek graphein).
Surname or Lastname
English
English : from Middle English, Old English dohtor ‘daughter’. The application is unclear; perhaps it was a surname acquired by the retainers of an heiress of an important family.
Surname or Lastname
English
English : nickname from Old English stagga ‘male deer’, ‘stag’. In northern dialects of Middle English the term was also used of a young horse, perhaps under Scandinavian influence, and in some cases this meaning may lie behind the original application of the name.
Surname or Lastname
Irish
Irish : reduced Anglicized form of either of two Gaelic names, Ó DuibhÃn ‘descendant of DuibhÃn’, a byname meaning ‘little black one’, or Ó DaimhÃn ‘descendant of DaimhÃn’, a byname meaning ‘fawn’, ‘little stag’. These are attenuated versions of Ó Dubháin and Ó Damháin, and are the phonetic origin of Anglicizations with an internal v (as opposed to w, as in Dewan, or monosyllabic forms with an o or u) (see Doane).English and French : nickname, of literal or ironic application, from Middle English, Old French devin, divin ‘excellent’, ‘perfect’ (Latin divinus ‘divine’).
IMPLICATION GRAPH
IMPLICATION GRAPH
IMPLICATION GRAPH
IMPLICATION GRAPH
IMPLICATION GRAPH
IMPLICATION GRAPH
IMPLICATION GRAPH
n.
The act of making request of soliciting; as, an application for an office; he made application to a court of chancery.
n.
The act of implicating, or the state of being implicated.
v. i.
Intricacy; complication.
adv.
By implication.
n.
Wrong explication.
n.
Imploration.
a.
Tending to implicate.
adv.
By application.
n.
A request; a document containing a request; as, his application was placed on file.
n.
Application.
adv.
By implication or inference.
n.
An implying, or that which is implied, but not expressed; an inference, or something which may fairly be understood, though not expressed in words.
n.
The act of fixing the mind or closely applying one's self; assiduous effort; close attention; as, to injure the health by application to study.
n.
The act of directing or referring something to a particular case, to discover or illustrate agreement or disagreement, fitness, or correspondence; as, I make the remark, and leave you to make the application; the application of a theory.
n.
The act of imprecating, or invoking evil upon any one; a prayer that a curse or calamity may fall on any one; a curse.
n.
The act of imploring; earnest supplication.
n.
The act or process of dividing by natural growth or spontaneous action; as, the duplication of cartilage cells.
n.
The capacity of being practically applied or used; relevancy; as, a rule of general application.
n.
The act of applying or laying on, in a literal sense; as, the application of emollients to a diseased limb.
n.
Hence, in specific uses: (a) That part of a sermon or discourse in which the principles before laid down and illustrated are applied to practical uses; the "moral" of a fable. (b) The use of the principles of one science for the purpose of enlarging or perfecting another; as, the application of algebra to geometry.