Square Difference Labeling of Some Graphs

The paper considers some methods to construct square difference labeling of cactus cycle C m ( n ) of single-point connection of n copies of cycle C m and n copies of path P 2 of single-point connection of n copies of cycle C m and path P n+1 as well as disjoint union of single-point connection of n...

Full description

Saved in:
Bibliographic Details
Published in:Cybernetics and systems analysis 2016-07, Vol.52 (4), p.636-640
Main Author: Sherman, Z. O.
Format: Article
Language:English
Subjects:
Artificial Intelligence
Construction
Control
Cybernetics
Graphs
Labeling
Marking
Mathematics
Mathematics and Statistics
Prime numbers
Processor Architectures
Software Engineering/Programming and Operating Systems
Studies
Systems analysis
Systems Theory
Unions
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The paper considers some methods to construct square difference labeling of cactus cycle C m ( n ) of single-point connection of n copies of cycle C m and n copies of path P 2 of single-point connection of n copies of cycle C m and path P n+1 as well as disjoint union of single-point connection of n copies of cycle C m with path P n .
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-016-9866-6