Strongly indexable graphs
B. D. Acharya,S. M. Hegde +1 more
70
TL;DR: It is found that a strongly indexable graph has exactly one nontrivial component which is either a star or has a traingle in any strongly k-indexable graph the minimum point degree is at most 3.
read more
About: This article is published in Discrete Mathematics. The article was published on 02 Jan 1991. and is currently open access. The article focuses on the topics: Strongly regular graph.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
A Dynamic Survey of Graph Labeling
TL;DR: In this survey I have collected everything I could find on graph labelings techniques that have appeared in journals that are not widely available.
( a,d )-edge-antimagic total labelings of caterpillars
Kiki A. Sugeng,Mirka Miller,Slamin,Martin Bača +3 more
- 13 Sep 2003
TL;DR: The super (a,d)-edge-antimagic total properties of stars Sn and caterpillar Sn1,n2,...,nr are studied.
42
On super (a,d)-edge-antimagic total labeling of disconnected graphs
TL;DR: In this article, the super (a,d)-edge-antimagic total properties of disconnected graphs mC"n and mP"n were studied, where the smallest possible labels appeared on the vertices.
40
•Journal Article
On The Super Edge-Magic Deficiency Of Graphs.
TL;DR: The question studied in this paper is for which graphs is it possible to add a finite number of isolated vertices so that the resulting graph is super edge-magic, and if it is possible for a given graph G, then it is said to be + ∞.
Bi-magic and other generalizations of super edge-magic labelings
TL;DR: In this paper, the authors used the product ⊗h in order to study super edge-magic labelings, bi-magic labels, and optimal k-equitable labelings.
References
•Book
Graph theory
Frank Harary
- 01 Jan 1969
TL;DR: This project focuses on Tutte’s work in cryptography, which enabled the British to read high-level German army messages and has been described as one of the greatest intellectual feats of the war.
18K
How to number a graph
Solomon W. Golomb
- 01 Jan 1972
TL;DR: In this paper, the problem of numbering a graph is to assign integers to the nodes so as to achieve a given goal, i.e., to assign integer values to each node in a graph so that the number of nodes in the graph can be expressed as a function of the relationship between the nodes and the target nodes.
322
On sequential labelings of graphs
TL;DR: It is shown that any tree admitting an α-valuation also admits a sequential labeling and hence is harmonious, and Constructions are given for new families of graceful and sequential graphs, generalizing some earlier results.
64