NDLI: Some results on exclusive sum graphs

Content Provider	Springer Nature Link
Author	Wang, Haitang Li, Ping
Copyright Year	2009
Abstract	Let N(Z) denote the set of all positive integers (integers). The sum graph G $^{+}$(S) of a finite subset S⊂N(Z) is the graph (S,E) with uv∈E if and only if u+v∈S. A graph G is said to be an (integral) sum graph if it is isomorphic to the sum graph of some S⊂N(Z). A sum labelling S is called an exclusive sum labelling if u+v∈S∖V(G) for any edge uv∈E(G). We say that G is labeled exclusively. The least number r of isolated vertices such that G∪rK $_{1}$ is an exclusive sum graph is called the exclusive sum number ε(G) of graph G. In this paper, we discuss the exclusive sum number of disjoint union of two graphs and the exclusive sum number of some graph classes.
Starting Page	343
Ending Page	351
Page Count	9
File Format	PDF
ISSN	15985865
Journal	Journal of Applied Mathematics and Computing
Volume Number	34
Issue Number	1-2
e-ISSN	18652085
Language	English
Publisher	Springer-Verlag
Publisher Date	2009-08-18
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	(Integral, Exclusive) sum graph (Integral, Exclusive) sum number (Integral, Exclusive) sum labelling Graph K $_{r,s}$ Graph K $_{r,s}$−E(rK $_{2}$) Graph K $_{n}$−E(K $_{r}$) Crown Mathematics of Computing Theory of Computation ApplicationMathematics/Computational Methods of Engineering Computational Mathematics and Numerical Analysis
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Computational Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

[r,s,t]-Coloring of K $_{ n,n }$

Labelling of some planar graphs with a condition at distance two

Graph partition into K $_{3}$s and K $_{4}$s

Decomposition of complete multigraphs into crown graphs

On the odd harmonious graphs with applications

Some results on starlike trees and sunlike graphs

On the geodetic number of permutation graphs

Minimum 2-tuple dominating set of permutation graphs

A lower bound for the convexity number of some graphs

Some results on exclusive sum graphs

Similar Documents

[r,s,t]-Coloring of K $_{ n,n }$

Labelling of some planar graphs with a condition at distance two

Graph partition into K $_{3}$s and K $_{4}$s

Decomposition of complete multigraphs into crown graphs

On the odd harmonious graphs with applications

Some results on starlike trees and sunlike graphs

On the geodetic number of permutation graphs

Minimum 2-tuple dominating set of permutation graphs

A lower bound for the convexity number of some graphs

Some results on exclusive sum graphs