CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Edge Dominating Functions of Quadratic Residue Cayley Graphs

by S. Jeelani Begum, B. Maheswari
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 54 - Number 17
Year of Publication: 2012
Authors: S. Jeelani Begum, B. Maheswari
10.5120/8663-2364

S. Jeelani Begum, B. Maheswari . Edge Dominating Functions of Quadratic Residue Cayley Graphs. International Journal of Computer Applications. 54, 17 ( September 2012), 47-49. DOI=10.5120/8663-2364

@article{ 10.5120/8663-2364,
author = { S. Jeelani Begum, B. Maheswari },
title = { Edge Dominating Functions of Quadratic Residue Cayley Graphs },
journal = { International Journal of Computer Applications },
issue_date = { September 2012 },
volume = { 54 },
number = { 17 },
month = { September },
year = { 2012 },
issn = { 0975-8887 },
pages = { 47-49 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume54/number17/8663-2364/ },
doi = { 10.5120/8663-2364 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:56:06.265116+05:30
%A S. Jeelani Begum
%A B. Maheswari
%T Edge Dominating Functions of Quadratic Residue Cayley Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 54
%N 17
%P 47-49
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The concept of edge domination is introduced by Mitchell and Hedetniemi [6]. Further results on edge domination are given in Arumugam and Velammal [2]. Functional generalization for vertex subsets has been studied extensively in literature [4, 5]. Cockayne and Mynhardt [3] have introduced that edge subsets may also be embedded into sets of functions and an analogous concept of convexity could also be developed. In this paper we obtain results on minimal edge dominating functions of G(Zp, Q) and the convexity of these functions are discussed. The theory of Edge Dominating Functions in quadratic residue Cayley graphs helps in finding optimal global and local alignments for the smooth conduction of a work and improves the ability of a task or a job in connected systems such as transportation process, communication tools, networks etc.

References
  1. Arumugam, S. , and Sithara Jerry. - Fractional edge domination in graphs, Appl. Anal. Discrete Math. 3 (2009), 359–370.
  2. Arumugam, S. , and Velammal, S. - Edge domination in graphs, Taiwanese Journal of Mathematics, 2 (2) (1998), 173–179.
  3. Cockayne, E. J. , and Mynhardt, C. M. - Convexity of extremal domination-related functions of graphs. In Domination in Graphs - Advanced Topics, (Ed. T. W. Haynes, S. T. Hedetniemi, P. J. Slater), Marcel Dekker, Inc. , New York, (1998), 109–131.
  4. Haynes, T. W. , Hedetniemi, S. T. , and Slater, P. J. - Fundamentals of domination in graphs, Marcel Dekker, Inc. , New York (1998).
  5. Haynes, T. W. , Hedetniemi, S. T. , and Slater, P. J. - Domination in Graphs: Advanced Topics, Marcel Dekker, Inc. , New York (1998).
  6. Mitchell, S. , and Hedetniemi, S. T. - Edge domination in trees. Congr. Numer. , 19, (1977), 489–509.
Index Terms

Computer Science
Information Sciences

Keywords

Edge Dominating Functions – Minimal Edge Dominating Functions – Convexity

Powered by PhDFocusTM