Matches in SemOpenAlex for { <https://semopenalex.org/work/W2495001608> ?p ?o ?g. }
Showing items 1 to 54 of
54
with 100 items per page.
- W2495001608 endingPage "237" @default.
- W2495001608 startingPage "227" @default.
- W2495001608 abstract "In this paper we introduce a new graph labeling called k-prime cordial labeling. Let G be a (p, q) graph and 2 ≤ p ≤ k. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called a k-prime cordial labeling of G if |v<sub>f</sub> (i) − v<sub>f</sub> (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |e<sub>f</sub> (0) − e<sub>f</sub> (1)| ≤ 1 where v<sub>f</sub> (x) denotes the number of vertices labeled with x, e<sub>f</sub> (1) and e<sub>f</sub> (0) respectively denote the number of edges labeled with 1 and not labeled with 1. A graph with a k-prime cordial labeling is called a k-prime cordial graph. In this paper we investigate the k-prime cordial labeling behavior of a star and we have proved that every graph is a subgraph of a k-prime cordial graph. Also we investigate the 3-prime cordial labeling behavior of path, cycle, complete graph, wheel, comb and some more standard graphs." @default.
- W2495001608 created "2016-08-23" @default.
- W2495001608 creator A5036578850 @default.
- W2495001608 creator A5037058799 @default.
- W2495001608 creator A5052717637 @default.
- W2495001608 creator A5054222938 @default.
- W2495001608 date "2016-05-30" @default.
- W2495001608 modified "2023-10-18" @default.
- W2495001608 title "k-PRIME CORDIAL GRAPHS" @default.
- W2495001608 doi "https://doi.org/10.14317/jami.2016.227" @default.
- W2495001608 hasPublicationYear "2016" @default.
- W2495001608 type Work @default.
- W2495001608 sameAs 2495001608 @default.
- W2495001608 citedByCount "3" @default.
- W2495001608 countsByYear W24950016082018 @default.
- W2495001608 countsByYear W24950016082020 @default.
- W2495001608 countsByYear W24950016082021 @default.
- W2495001608 crossrefType "journal-article" @default.
- W2495001608 hasAuthorship W2495001608A5036578850 @default.
- W2495001608 hasAuthorship W2495001608A5037058799 @default.
- W2495001608 hasAuthorship W2495001608A5052717637 @default.
- W2495001608 hasAuthorship W2495001608A5054222938 @default.
- W2495001608 hasBestOaLocation W24950016081 @default.
- W2495001608 hasConcept C114614502 @default.
- W2495001608 hasConcept C118615104 @default.
- W2495001608 hasConcept C132525143 @default.
- W2495001608 hasConcept C184992742 @default.
- W2495001608 hasConcept C33923547 @default.
- W2495001608 hasConceptScore W2495001608C114614502 @default.
- W2495001608 hasConceptScore W2495001608C118615104 @default.
- W2495001608 hasConceptScore W2495001608C132525143 @default.
- W2495001608 hasConceptScore W2495001608C184992742 @default.
- W2495001608 hasConceptScore W2495001608C33923547 @default.
- W2495001608 hasIssue "3_4" @default.
- W2495001608 hasLocation W24950016081 @default.
- W2495001608 hasOpenAccess W2495001608 @default.
- W2495001608 hasPrimaryLocation W24950016081 @default.
- W2495001608 hasRelatedWork W1975886103 @default.
- W2495001608 hasRelatedWork W1978699240 @default.
- W2495001608 hasRelatedWork W2000144448 @default.
- W2495001608 hasRelatedWork W2067133893 @default.
- W2495001608 hasRelatedWork W2071261821 @default.
- W2495001608 hasRelatedWork W2287003313 @default.
- W2495001608 hasRelatedWork W2374778222 @default.
- W2495001608 hasRelatedWork W2950502167 @default.
- W2495001608 hasRelatedWork W3003396734 @default.
- W2495001608 hasRelatedWork W4220969658 @default.
- W2495001608 hasVolume "34" @default.
- W2495001608 isParatext "false" @default.
- W2495001608 isRetracted "false" @default.
- W2495001608 magId "2495001608" @default.
- W2495001608 workType "article" @default.