A magic graph is a graph whose edges are labelled by the first q positive integers, where q is the number of edges, so that the sum over the edges incident...

A magic polygon is a polygonal magic graph with integers on its vertices. A magic polygon, also called a perimeter magic polygon, is a polygon with an...

NeoMagic Corporation is a fabless semiconductor company and supplier of low-power audio and video integrated circuits for mobile use (MagicMedia). In October...

In nuclear physics, a magic number is a number of nucleons (either protons or neutrons, separately) such that they are arranged into complete shells within...

the author of a book on magic graphs and graph labeling, Magic Graphs (2nd ed., Springer, 2013). She spoke about magic graph labelings as an invited speaker...

In graph theory, a branch of mathematics, the Herschel graph is a bipartite undirected graph with 11 vertices and 18 edges. It is a polyhedral graph (the...

"Anti-magic Squares". www.magic-squares.net. Retrieved 2016-12-03. Gray, I. D.; MacDougall, J.A. (2006). "Sparse anti-magic squares and vertex-magic labelings...

The Knowledge Graph is a knowledge base from which Google serves relevant information in an infobox beside its search results. This allows the user to...

covering complete graphs by cycles, the characterization of magic graphs, and Ringel's Earth–Moon problem on coloring biplanar graphs. Despite its subtitle...

mathworld.wolfram.com. "Biconnected graph information". mathworld.wolfram.com. Sarcone, Gianni (December 20, 2020). "Magic Inscribed Lotus information". archimedes-lab...

and FX - 233 MHz/266 MHz Pentium MMX, 4.3 GB hard drive, 2 MB Neo Magic MagicGraph graphics September 1998 PCG-505 TR/TS/TX - 300 MHz Pentium MMX, 6.4 GB...

combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory...

was completed by July 1987), enabling them to graph and explore its dynamics on a computer. The graph was fractal: It exhibited a pattern in which a...

1997: C-family announced (with CP-line) 1996: Latitude XPi P133ST (NeoMagic NM2070 video chipset, 24 MB of memory (8 MB soldered), 1.2 GB hard disk...

In graph theory, all graphs with four or fewer vertices are planar, however, there is a graph with five vertices that is not: K5, the complete graph with...

{\displaystyle I-1} is a prime number. The four-color theorem states that a planar graph (or, equivalently, a flat map of two-dimensional regions such as countries)...

together enough material to manufacture another Code-O-Graph, the 1945 "Magni-Magic" Code-O-Graph. This unit used stamped sheet steel for the badge bodies...

research areas are natural computing, formal language and automata theory, graph transformations, and concurrent systems. He is referred to as the guru of...

Sudoku puzzle can be expressed as a graph coloring problem. The aim is to construct a 9-coloring of a particular graph, given a partial 9-coloring. The fewest...

BrownWalker Press, 2008), and (posthumously) Magic and Antimagic Graphs: Attributes, Observations and Challenges in Graph Labelings (with Bača, Joe Ryan, and Andrea...

Magic Cat Academy is a series of short browser games created as Google Doodles for Halloween which were released every four years. The first game, Magic...

sometimes called "magic corners". MacOS places the close button on the upper left side of the program window and the menu bar fills out the magic corner with...

152 Bock, Hans-Michael & Bergfelder, Tim. The Concise CineGraph. Encyclopedia of German Cinema. Berghahn Books, 2009. The Magic Mountain at IMDb v t e...

large graph G. Victor knows G but not the cycle (e.g., Peggy has generated G and revealed it to him.) Finding a Hamiltonian cycle given a large graph is...

showed that other than one exceptional graph on 7 vertices, it is possible to obtain all permutations unless the graph is bipartite, in which case exactly...

planning and insurance applications. Profium Sense is a native RDF compliant graph database written in Java. It provides Datalog evaluation support of user...

In graph theory, the Lovász number of a graph is a real number that is an upper bound on the Shannon capacity of the graph. It is also known as Lovász...

Hoffman (1944), mathematician known for constructing the Hoffman–Singleton graph Bruce Mazlish (1944), American historian and professor at Massachusetts...

a functional for polynomials Blossom (graph theory), a subgraph in which removing any vertex leaves a graph with a perfect matching HMS Blossom, three...

Browsing SageTV Santa Tracker Schemer Scholar Search AI Overviews Knowledge Graph SafeSearch Searchwiki Sheets Shoploop Shopping Sidewiki Sites Slides Snapseed...