A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the late 1960s. In the intervening years dozens of graph labelings techniques have been studied in over 1000 papers. Finding out what has been done for any particular kind of labeling and keeping up with new discoveries is difficult because of the sheer number of papers and because many of the papers have appeared in journals that are not widely available. In this survey I have collected everything I could find on graph labeling. For the convenience of the reader the survey includes a detailed table of contents and index.

/pdf/a-dynamic-survey-of-graph-labeling-198znmwxtq.pdf

A Dynamic Survey of Graph Labeling

Our aim is to alternate elements of the general theory with significant examples. We deal now with synmietric functions. In this chapter we will develop some of the very basic theorems on symmetric functions, in part as a way to give a look into 19* century invariant theory, but as well to establish some useful formulas which will show their full meaning only after developing the representation theory of the linear and symmetric groups.

On symmetric functions.

Peterson varieties are a special class of Hessenberg varieties that have been extensively studied e.g. by Peterson, Kostant, and Rietsch, in connection with the quantum cohomology of the flag variety. In this manuscript, we develop a generalized Schubert calculus, and in particular a positive Chevalley-Monk formula, for the ordinary and Borel-equivariant cohomology of the Peterson variety $Y$ in type $A_{n-1}$, with respect to a natural $S^1$-action arising from the standard action of the maximal torus on flag varieties. As far as we know, this is the first example of positive Schubert calculus beyond the realm of Kac-Moody flag varieties $G/P$. 
Our main results are as follows. First, we identify a computationally convenient basis of $H^*_{S^1}(Y)$, which we call the basis of Peterson Schubert classes. Second, we derive a manifestly positive, integral Chevalley-Monk formula for the product of a cohomology-degree-2 Peterson Schubert class with an arbitrary Peterson Schubert class. Both $H^*_{S^1}(Y)$ and $H^*(Y)$ are generated in degree 2. Finally, by using our Chevalley-Monk formula we give explicit descriptions (via generators and relations) of both the $S^1$-equivariant cohomology ring $H^*_{S^1}(Y)$ and the ordinary cohomology ring $H^*(Y)$ of the type $A_{n-1}$ Peterson variety. Our methods are both directly from and inspired by those of GKM (Goresky-Kottwitz-MacPherson) theory and classical Schubert calculus. We discuss several open questions and directions for future work.

A positive Monk formula in the S^1-equivariant cohomology of type A Peterson varieties

In this paper, we study the geometry of various Hessenberg varieties in type A, as well as families thereof, with the additional goal of laying the groundwork for future computations of Newton-Okounkov bodies of Hessenberg varieties. Our main results are as follows. We find explicit and computationally convenient generators for the local defining ideals of indecomposable regular nilpotent Hessenberg varieties, and then show that all regular nilpotent Hessenberg varieties are local complete intersections. We also show that certain families of Hessenberg varieties, whose generic fibers are regular semisimple Hessenberg varieties and the special fiber is a regular nilpotent Hessenberg variety, are flat and have reduced fibres. This result further allows us to give a computationally effective formula for the degree of a regular nilpotent Hessenberg variety with respect to a Plucker embedding. Furthermore, we construct certain flags of subvarieties of a regular nilpotent Hessenberg variety, obtained by intersecting with Schubert varieties, which are suitable for computing Newton-Okounkov bodies. As an application of our results, we explicitly compute many Newton-Okounkov bodies of the two-dimensional Peterson variety with respect to Plucker embeddings.

Geometry of Hessenberg varieties with applications to Newton-Okounkov bodies

We define a family of ideals I h in the polynomial ring ?[x 1,?,x n ] that are parameterized by Hessenberg functions h (equivalently Dyck paths or ample partitions). The ideals I h generalize algebraically a family of ideals called the Tanisaki ideal, which is used in a geometric construction of permutation representations called Springer theory. To define I h , we use polynomials in a proper subset of the variables {x 1,?,x n } that are symmetric under the corresponding permutation subgroup. We call these polynomials truncated symmetric functions and show combinatorial identities relating different kinds of truncated symmetric polynomials. We then prove several key properties of I h , including that if h>h? in the natural partial order on Dyck paths, then I h ?I h?, and explicitly construct a Grobner basis for I h . We use a second family of ideals J h for which some of the claims are easier to see and prove that I h =J h . The ideals J h arise in work of Ding, Develin-Martin-Reiner, and Gasharov-Reiner on a family of Schubert varieties called partition varieties. Using earlier work of the first author, the current manuscript proves that the ideals I h =J h generalize the Tanisaki ideals both algebraically and geometrically, from Springer varieties to a family of nilpotent Hessenberg varieties.

/pdf/generalizing-tanisaki-s-ideal-via-ideals-of-truncated-asjqm747td.pdf

Generalizing Tanisaki's ideal via ideals of truncated symmetric functions

For a fixed we say that a point (r, s) in the integer lattice is b-visible from the origin if it lies on the graph of a power function f(x) = axb with and no other integer lattice point lies on thi...

Lattice Point Visibility on Generalized Lines of Sight

For a fixed $b\in\mathbb{N}=\{1,2,3,\ldots\}$ we say that a point $(r,s)$ in the integer lattice $\mathbb{Z} \times \mathbb{Z}$ is $b$-visible from the origin if it lies on the graph of a power function $f(x)=ax^b$ with $a\in\mathbb{Q}$ and no other integer lattice point lies on this curve (i.e., line of sight) between $(0,0)$ and $(r,s)$. We prove that the proportion of $b$-visible integer lattice points is given by $1/\zeta(b+1)$, where $\zeta(s)$ denotes the Riemann zeta function. We also show that even though the proportion of $b$-visible lattice points approaches $1$ as $b$ approaches infinity, there exist arbitrarily large rectangular arrays of $b$-invisible lattice points for any fixed $b$. This work specialized to $b=1$ recovers original results from the classical lattice point visibility setting where the lines of sight are given by linear functions with rational slope through the origin.

Lattice point visibility on generalized lines of sight

A coprime labeling of a simple graph of order n is a labeling in which adjacent vertices are given relatively prime labels, and a graph is prime if the labels used can be taken to be the first n positive integers. In this paper, we consider when ladder graphs are prime and when the corresponding labeling may be done in a cyclic manner around the vertices of the ladder. Furthermore, we discuss coprime labelings for complete bipartite graphs.

https://people.uwec.edu/mbirika/Coprime_and_prime_labelings_of_graphs.pdf

Coprime and Prime Labelings of Graphs.

A coprime labeling of a simple graph of order $n$ is a labeling in which adjacent vertices are given relatively prime labels, and a graph is prime if the labels used can be taken to be the first $n$ positive integers. In this paper, we consider when ladder graphs are prime and when the corresponding labeling may be done in a cyclic manner around the vertices of the ladder. Furthermore, we discuss coprime labelings for complete bipartite graphs.

Coprime and prime labelings of graphs

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Aba Mbirika

Author Tools

Chat about Author