{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EKNIY7L6FCCB2KLRLPPAL2EH6Z","short_pith_number":"pith:EKNIY7L6","schema_version":"1.0","canonical_sha256":"229a8c7d7e28841d29715bde05e887f67aa7fdcf1f581e7907534ac94432c19a","source":{"kind":"arxiv","id":"1801.05137","version":3},"attestation_state":"computed","paper":{"title":"Total dominator coloring of central graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adel P. Kazemi, Farshad Kazemnejad","submitted_at":"2018-01-16T07:19:30Z","abstract_excerpt":"A total dominator coloring of a graph $G$ is a proper coloring of $G$ in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number of a graph is the minimum number of color classes in a total dominator coloring of it. Here, we study the total dominator coloring on central graphs by giving some tight bounds for the total dominator chromatic number of the central of a graph, join of two graphs and Nordhaus-Gaddum-like relations. Also we will calculate the total dominator chromatic number of the central of a path, a cycle, a wheel, a comp"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1801.05137","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-16T07:19:30Z","cross_cats_sorted":[],"title_canon_sha256":"b34ba0a0b78704f897a7c910307b4355eb361b7f0276ee278fca8bf00d2517c7","abstract_canon_sha256":"7d35bac16b7dcb52530f2a380b3d4b9e6781cd7fc119956b9ab169389b741320"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:36.470391Z","signature_b64":"R0rK6ae4QDotyCZgKBAiVGy21TfCwIFz6p9tTVTUaFdtn5fwZ3Yg8oAs4301o/a4AF+BoN5o3GdShLzn6ghyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"229a8c7d7e28841d29715bde05e887f67aa7fdcf1f581e7907534ac94432c19a","last_reissued_at":"2026-05-18T00:16:36.469743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:36.469743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Total dominator coloring of central graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adel P. Kazemi, Farshad Kazemnejad","submitted_at":"2018-01-16T07:19:30Z","abstract_excerpt":"A total dominator coloring of a graph $G$ is a proper coloring of $G$ in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number of a graph is the minimum number of color classes in a total dominator coloring of it. Here, we study the total dominator coloring on central graphs by giving some tight bounds for the total dominator chromatic number of the central of a graph, join of two graphs and Nordhaus-Gaddum-like relations. Also we will calculate the total dominator chromatic number of the central of a path, a cycle, a wheel, a comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05137","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.05137","created_at":"2026-05-18T00:16:36.469833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.05137v3","created_at":"2026-05-18T00:16:36.469833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05137","created_at":"2026-05-18T00:16:36.469833+00:00"},{"alias_kind":"pith_short_12","alias_value":"EKNIY7L6FCCB","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EKNIY7L6FCCB2KLR","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EKNIY7L6","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EKNIY7L6FCCB2KLRLPPAL2EH6Z","json":"https://pith.science/pith/EKNIY7L6FCCB2KLRLPPAL2EH6Z.json","graph_json":"https://pith.science/api/pith-number/EKNIY7L6FCCB2KLRLPPAL2EH6Z/graph.json","events_json":"https://pith.science/api/pith-number/EKNIY7L6FCCB2KLRLPPAL2EH6Z/events.json","paper":"https://pith.science/paper/EKNIY7L6"},"agent_actions":{"view_html":"https://pith.science/pith/EKNIY7L6FCCB2KLRLPPAL2EH6Z","download_json":"https://pith.science/pith/EKNIY7L6FCCB2KLRLPPAL2EH6Z.json","view_paper":"https://pith.science/paper/EKNIY7L6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.05137&json=true","fetch_graph":"https://pith.science/api/pith-number/EKNIY7L6FCCB2KLRLPPAL2EH6Z/graph.json","fetch_events":"https://pith.science/api/pith-number/EKNIY7L6FCCB2KLRLPPAL2EH6Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EKNIY7L6FCCB2KLRLPPAL2EH6Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EKNIY7L6FCCB2KLRLPPAL2EH6Z/action/storage_attestation","attest_author":"https://pith.science/pith/EKNIY7L6FCCB2KLRLPPAL2EH6Z/action/author_attestation","sign_citation":"https://pith.science/pith/EKNIY7L6FCCB2KLRLPPAL2EH6Z/action/citation_signature","submit_replication":"https://pith.science/pith/EKNIY7L6FCCB2KLRLPPAL2EH6Z/action/replication_record"}},"created_at":"2026-05-18T00:16:36.469833+00:00","updated_at":"2026-05-18T00:16:36.469833+00:00"}